Leetcode228. Summary Ranges汇总区间

给定一个无重复元素的有序整数数组，返回数组区间范围的汇总。

示例 1:

输入: [0,1,2,4,5,7] 输出: ["0->2","4->5","7"] 解释: 0,1,2 可组成一个连续的区间; 4,5 可组成一个连续的区间。

示例 2:

输入: [0,2,3,4,6,8,9] 输出: ["0","2->4","6","8->9"] 解释: 2,3,4 可组成一个连续的区间; 8,9 可组成一个连续的区间。

 

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) 
    {
        int len = nums.size();
        vector<string> res;
        if(len == 0)
            return res;
        if(len == 1)
        {
            res.push_back(to_string(nums[0]));
            return res;
        }
        int start = 0;
        int end = 0;
        for(int i = 0; i < len; i++)
        {
            end = i;
            if(i == 0)
                continue;
            if(nums[i] - nums[i - 1] != 1)
            {
                if(start == end - 1)
                    res.push_back(to_string(nums[start]));
                else
                 res.push_back(to_string(nums[start]) + "->" + to_string(nums[end - 1]));
                start = i;
            }
            if(i == len - 1)
            {
                if(start != end)
                    res.push_back(to_string(nums[start]) + "->" + to_string(nums[end]));
                else
                    res.push_back(to_string(nums[start]));
            }
        }
        return res;
    }
};

 

转载于:https://www.cnblogs.com/lMonster81/p/10433813.html