Summary Ranges

原创于 2015-12-11 16:50:41 发布 · 270 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode之旅同时被 2 个专栏收录

65 篇文章

订阅专栏

c++

29 篇文章

订阅专栏

此博客介绍了一个算法，用于处理已排序且无重复的整数数组，并将其区间总结为字符串形式。例如，对于数组 [0,1,2,4,5,7]，输出将是 ['0->2', '4->5', '7']。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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> result;
        if(nums.size() == 0)
            return result;
        string temp = "";
        int i=0;
        int start = 0;
        while(i<nums.size()){
            if(temp == ""){
                temp = to_string(nums[i]);
                start = i;
                i++;
            }else if(nums[i]-nums[i-1] != 1){
                if(start != i-1)
                    temp += "->" + to_string(nums[i-1]);
                result.push_back(temp);
                temp = "";
            }else{
                i++;
            }
        }
        if(temp != ""){
            if(start != i-1){
                temp += "->" + to_string(nums[i-1]);
            }
            result.push_back(temp);
        }
        return result;
    }
};