LeetCode228. Summary Ranges

最新推荐文章于 2024-09-03 21:34:10 发布

叶卡捷琳堡

最新推荐文章于 2024-09-03 21:34:10 发布

阅读量452

点赞数 5

文章标签：数据结构算法 leetcode c++

本文链接：https://blog.csdn.net/weixin_46841376/article/details/136329297

版权

本文介绍了一个编程问题，要求给定一个已排序且不重复的整数数组，生成一个最小的有序区间列表，每个区间恰好包含数组中的一个元素。解决方案提供了一个C++类`Solution`的方法，通过遍历数组并合并连续的区间来实现.

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

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.

二、题解

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