leetcode 228. Summary Ranges（总结区间）

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

Example 1:

Input: [0,1,2,4,5,7]
Output: [“0->2”,“4->5”,“7”]
Explanation: 0,1,2 form a continuous range; 4,5 form a continuous range.
Example 2:

Input: [0,2,3,4,6,8,9]
Output: [“0”,“2->4”,“6”,“8->9”]
Explanation: 2,3,4 form a continuous range; 8,9 form a continuous range.

给出一个排序好的整数数组，找出连续的区间，每个区间用string表示

思路：
双指针，一个指向区间的start，一个指向end
遍历数组，当连续时end+1，不连续时装入区间，同时start和end更新为下一区间初始值

但是要注意遍历结束后最后一个区间需要装入结果的list中

    public List<String> summaryRanges(int[] nums) {
        List<String> result = new ArrayList<>();
        if (nums == null || nums.length == 0) {
            return result;
        }
        
        int start = nums[0];
        int end = start;
        
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] - end == 1) {
                end = nums[i];
            } else {
                if (start == end) {
                    result.add("" + start);
                } else {
                    result.add("" + start + "->" + end);
                }               
                start = nums[i];
                end = start;
            }
        }
        
        if (start == end) {
            result.add("" + start);
        } else {
            result.add("" + start + "->" + end);
        }  
        
        return result;
    }