LeetCode 228. Summary Ranges

You are given a sorted unique integer array nums.

A range [a,b] is the set of all integers from a to b (inclusive).

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"

Example 2:

Input: nums = [0,2,3,4,6,8,9]
Output: ["0","2->4","6","8->9"]
Explanation: The ranges are:
[0,0] --> "0"
[2,4] --> "2->4"
[6,6] --> "6"
[8,9] --> "8->9"

Constraints:

• 0 <= nums.length <= 20
• -231 <= nums[i] <= 231 - 1
• All the values of nums are unique.
• nums is sorted in ascending order.

---

就，非常普通，没有任何技巧，硬写就完事儿了。题目刚开始读了一小会儿，就是要连续数字的range，注意如果是只有一个数字的话没有->。刚开始没写好的一个地方就是忘了判断i + count < nums.length那里。

Runtime: 0 ms, faster than 100.00% of Java online submissions for Summary Ranges.

Memory Usage: 42.3 MB, less than 47.64% of Java online submissions for Summary Ranges.

class Solution {
    public List<String> summaryRanges(int[] nums) {
        List<String> result = new ArrayList<>();
        int i = 0;
        while (i != nums.length) {
            int count = 1;
            while ((i + count < nums.length) && (nums[i] + count == nums[i + count])) {
                count++;
            }
            StringBuilder sb = new StringBuilder();
            sb.append(nums[i]);
            if (count != 1) {
                sb.append("->");
                sb.append(nums[i + count - 1]);
            }
            result.add(sb.toString());
            i += count;
        }
        return result;
    }
}