[leetcode]Summary Ranges

Summary Ranges

 

Given a sorted integer array without duplicates, return the summary of its ranges.

For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].

public class Solution {
    public List<String> summaryRanges(int[] nums) {
        List<String> ls = new ArrayList<String>();
        if(nums.length < 1) return ls;
        
        int idx = 0;
        int val = nums[idx];
        int i = 1;
        for(i = 1; i < nums.length; i++){
            if(nums[i] == ++val) continue;
            
            if(i - 1 != idx){
                ls.add("" + nums[idx] + "->" + nums[i - 1]);
            }else{
                ls.add("" + nums[idx]);
            }
            idx = i;
            val = nums[idx];
        
        }
        if(i - 1 != idx){
            ls.add("" + nums[idx] + "->" + nums[i - 1]);
        }else{
            ls.add("" + nums[idx]);
        }
        
        return ls;
    }
}