面试经典 150 题 1 —（区间）— 228. 汇总区间

最新推荐文章于 2024-08-30 16:00:44 发布

BreezeChasingDrizzle

最新推荐文章于 2024-08-30 16:00:44 发布

阅读量40

点赞数

分类专栏： leetcode 文章标签： c++ leetcode 数据结构算法

本文链接：https://blog.csdn.net/weixin_44032178/article/details/133816716

版权

leetcode 专栏收录该内容

174 篇文章 0 订阅

订阅专栏

228. 汇总区间

在这里插入图片描述

方法一

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        int numsLength = nums.size(), start = 0, end = 0;
        vector<string> result;

        while(end < numsLength){
            if(end + 1 < numsLength && nums[end + 1] == nums[end] + 1){
                end++;
            }else{
                if(start == end){
                    result.push_back(to_string(nums[start]));
                }else{
                    result.push_back(to_string(nums[start]) + "->" + to_string(nums[end]));
                }
                start = end + 1;
                end = start;
            }
        }
        return result;
    }
};

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        int numsLength = nums.size(), i = 0;
        vector<string> result;

        while(i < numsLength){
            int start = i;
            while(i + 1 < numsLength && nums[i + 1] == nums[i] + 1){
                i++;
            }
            if(i == start){
                result.push_back(to_string(nums[start]));
            }else{
                result.push_back(to_string(nums[start]) + "->" + to_string(nums[i]));

            }
            i++;
        }
        return result;
    }
};

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        int numsLength = nums.size(), start = 0;
        vector<string> result;

        for(int end = 0; end < numsLength; end++){
            if(end + 1 == numsLength || nums[end + 1] != nums[end] + 1){
                if(start == end){
                    result.push_back(to_string(nums[start]));
                }else{
                    result.push_back(to_string(nums[start]) + "->" + to_string(nums[end]));
                }
                start = end + 1;
            }
        }
        return result;
    }
};

class Solution {
public:
    vector<string> summaryRanges(vector<int>& nums) {
        vector<string> ret;
        int i = 0;
        int n = nums.size();
        while (i < n) {
            int low = i;
            i++;
            while (i < n && nums[i] == nums[i - 1] + 1) {
                i++;
            }
            int high = i - 1;
            string temp = to_string(nums[low]);
            if (low < high) {
                temp.append("->");
                temp.append(to_string(nums[high]));
            }
            ret.push_back(move(temp));
        }
        return ret;
    }
};