Leetcode 228. Summary Ranges

public class Solution {
    public List<String> summaryRanges(int[] nums) {
        int i = 1, j = 0;
        List<String> res = new ArrayList<String>();
        if (nums.length == 0) return res;
        while (i < nums.length) {
            if (nums[i-1]+1 == nums[i]) i++;
            else {
                if (i-1 != j)
                    res.add(nums[j] + "->" + nums[i-1]);
                else
                    res.add(nums[j]+"");
                j = i;
                i++;
            }
        }
        if (j == i-1) res.add(nums[nums.length-1]+"");
        else res.add(nums[j] + "->" + nums[i-1]);
        return res;
    }
}