[leetcode 56] Merge Intervals

最新推荐文章于 2025-09-05 23:16:08 发布

「已注销」

最新推荐文章于 2025-09-05 23:16:08 发布

阅读量217

点赞数

CC 4.0 BY-SA版权

分类专栏： [LeetCode 刷题] 文章标签： leetcode Array Sort

本文链接：https://blog.youkuaiyun.com/xinxinxv/article/details/42467691

[LeetCode 刷题] 专栏收录该内容

158 篇文章

订阅专栏

本文介绍如何将一组区间合并为最少数量的不相交区间。

Given a collection of intervals, merge all overlapping intervals.

For example,
Given [1,3],[2,6],[8,10],[15,18],
return [1,6],[8,10],[15,18].

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
class Solution {
public:
    vector<Interval> merge(vector<Interval> &intervals) {
        vector<Interval> res;
        for (int i = 0; i < intervals.size(); i++) {
            insert(res, intervals[i]);
        }
        return res;
        
    }
    void insert(vector<Interval> &res, Interval newInterval) {
        auto it = res.begin();
        while (it != res.end()) {
            if (newInterval.end < it->start) {
                res.insert(it, newInterval);
                return ;
            } else if (newInterval.start > it->end) {
                it++;
                continue;
            } else {
                newInterval.start = min(newInterval.start, it->start);
                newInterval.end = max(newInterval.end, it->end);
                it = res.erase(it);
            }
        }
        res.push_back(newInterval);
    }
};