[LeetCode]Summary Ranges

最新推荐文章于 2021-02-13 11:48:21 发布

CiaoLiang

最新推荐文章于 2021-02-13 11:48:21 发布

阅读量437

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/CiaoLiang/article/details/46680595

版权

LeetCode 专栏收录该内容

149 篇文章 0 订阅

订阅专栏

Given a sorted integer array without duplicates, return the summary of its ranges.

For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].

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