Leetcode 228: Summary Ranges

问题描述：

You are given a sorted unique integer array nums.

Return the smallest sorted list of ranges that cover all the numbers in the array exactly. That is, each element of nums is covered by exactly one of the ranges, and there is no integer x such that x is in one of the ranges but not in nums.

Each range [a,b] in the list should be output as:

“a->b” if a != b
“a” if a == b

Example 1:

Input: nums = [0,1,2,4,5,7]
Output: [“0->2”,“4->5”,“7”]
Explanation: The ranges are:
[0,2] --> “0->2”
[4,5] --> “4->5”
[7,7] --> “7”

返回连续的区间

思路：
用两个指针遍历nums。slow指针先不动，除非逐一增加的i遇到了下一个比这一个大超过一的情况，这时候意味着目前的连续区间结束了，我们要收了这个区间，这时候用到一直没动的slow作为区间左界，i作为区间右界。这个区间写入list后，我们调整slow至i+1，继续做同样的事。最终while循环终止时，我们要在while loop外手工收录最后一个连续区间.

代码如下：

class Solution {
    public List<String> summaryRanges(int[] nums) {
        List<String> myList = new ArrayList<String>();
        if (nums.length==0) return myList;
        int slow = 0;
        for(int i=0; i<nums.length; i++){
            if((i+1<nums.length)&&(nums[i+1]-nums[i]!=1)){
                myList.add(stringFormat(nums[slow], nums[i]));
                slow = i+1;
            }
        }
        myList.add(stringFormat(nums[slow], nums[nums.length-1]));
        return myList;
    }
    
    public String stringFormat(int left_bound, int right_bound){
        if (left_bound==right_bound){
            return String.valueOf(left_bound);
        }
        else{
            return left_bound + "->" + right_bound;
        }
    }
}

时间复杂度 O(n)