[array]228. Summary Ranges

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.

solution1 一次遍历

我们从数组的位置 00 出发，向右遍历。每次遇到相邻元素之间的差值大于 11 时，我们就找到了一个区间。遍历完数组之后，就能得到一系列的区间的列表。

在遍历过程中，维护下标 \textit{low}low 和 \textit{high}high 分别记录区间的起点和终点，对于任何区间都有 \textit{low} \le \textit{high}low≤high。当得到一个区间时，根据 \textit{low}low 和 \textit{high}high 的值生成区间的字符串表示。

当 \textit{low}<\textit{high}low<high 时，区间的字符串表示为 ``\textit{low} \rightarrow \textit{high}“‘‘low→high”；

当 \textit{low}=\textit{high}low=high 时，区间的字符串表示为 ``\textit{low}“‘‘low”。

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> ret;
        int i = 0;
        int n = nums.size();
        while (i < n) {
            int low = i;
            i++;
            while (i < n && nums[i] == nums[i - 1] + 1) {
                i++;
            }
            int high = i - 1;
            string temp = to_string(nums[low]);
            if (low < high) {
                temp.append("->");
                temp.append(to_string(nums[high]));
            }
            ret.push_back(move(temp));
        }
        return ret;
    }

作者：LeetCode-Solution
链接：https://leetcode.cn/problems/summary-ranges/solution/hui-zong-qu-jian-by-leetcode-solution-6zrs/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> ans;
        int left = 0;

        for (int i = 0; i < nums.size(); ++i) {
            if (i + 1 == nums.size() || nums[i] + 1 != nums[i + 1]) {
                ans.push_back(std::to_string(nums[left]) + (left == i ? "" : "->" + std::to_string(nums[i])));
                left = i + 1;
            }
        }

        return ans;
    }
};

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> ans;
        int i = 0;
        while(i < nums.size())
        {
            int l = i++;
            while(i < nums.size() && nums[i] == nums[i-1] + 1)
                ++i;
            int r = i-1;
            string temp = to_string(nums[l]);
            ans.push_back(l == r? temp : temp + "->" + to_string(nums[r]));
        }
        return ans;
    }
};

作者：Xiaohu9527
链接：https://leetcode.cn/problems/summary-ranges/solution/cjian-ma-by-xiaohu9527-wrf5/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。