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"

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"

Example 3:

Input: nums = []
Output: []

Example 4:

Input: nums = [-1]
Output: ["-1"]

Example 5:

Input: nums = [0]
Output: ["0"]

 

Constraints:

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

题目难度：简单题

C++代码：

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> vec;
        string s;
        int j;
        // i指向连续range数组的第一个数，j一开始指向i下一个，如果一直是相邻的，则j一直往后移，直到j指向第一个不属于range数组的数。
        for (int i = 0; i < nums.size();) {
            j = i + 1;
            while (j < nums.size()){
                if (nums[j - 1] + 1 != nums[j])
                    break;
                ++j;
            }
            //这种情况表示i指向的range数组只有一个数。
            if (j - i == 1) {
                s = to_string(nums[i]);
            } else {
                s = to_string(nums[i]) + "->" + to_string(nums[j - 1]);
            }
            vec.push_back(s);
            i = j; //i指向下一个range数组
        }
        return vec;
    }
};

时间复杂度：$O(n)$

---

python3代码：

class Solution:
    def summaryRanges(self, nums: List[int]) -> List[str]:
        ranges = []
        for n in nums:
            if not ranges or n > ranges[-1][-1] + 1:
                ranges += [], // 最后的,很重要
            ranges[-1][1:] = n, //最后的,很重要
        return ['->'.join(map(str, r)) for r in ranges]