leetcode 228. Summary Ranges

最新推荐文章于 2024-10-31 00:15:00 发布

原创最新推荐文章于 2024-10-31 00:15:00 发布 · 193 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

leetcode

230 篇文章

订阅专栏

本文介绍了一种算法，用于处理已排序且不包含重复元素的整数数组，并返回该数组中连续整数区间的汇总。例如，对于输入数组[0,1,2,4,5,7]，输出为[0->24->57]；对于输入数组[0,2,3,4,6,8,9]，输出为[02->468->9]。

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

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

Example 1:

Input:  [0,1,2,4,5,7]
Output: ["0->2","4->5","7"]
Explanation: 0,1,2 form a continuous range; 4,5 form a continuous range.

Example 2:

Input:  [0,2,3,4,6,8,9]
Output: ["0","2->4","6","8->9"]
Explanation: 2,3,4 form a continuous range; 8,9 form a continuous range.

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        
        vector<string> ret;
        
        for (int i=0; i<nums.size();) {
            int begin = i;
            int end = i;
            while ((i+1 < nums.size()) && (nums[i]+1 == nums[i+1])) {
                i++;
                end = i;
            }
            
            if (begin == end) {
                ret.push_back(to_string(nums[begin]));
            }
            else {
                string range = to_string(nums[begin]) + "->" + to_string(nums[end]);
                ret.push_back(range);
            }
            
            i++;
        }
        
        return ret;
    }
};