[Leetcode]Merge Intervals

最新推荐文章于 2021-12-01 20:25:26 发布

原创最新推荐文章于 2021-12-01 20:25:26 发布 · 337 阅读

0 ·

CC 4.0 BY-SA版权

Array 同时被 2 个专栏收录

35 篇文章

订阅专栏

Sort

5 篇文章

订阅专栏

本文介绍如何使用算法将重叠的区间合并为最少数量的不重叠区间。通过排序和遍历，实现高效的时间复杂度。

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

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:
    /*algorithm  sort + merge
      1)for interval[begin,end], sort first by begin , if same, by end
      2)merge
      time O(n*lgn)
    */
    struct cmp {
      bool operator()(const Interval& l,const Interval &r){
            return l.start < r.start;     
      }
    } myCmp;
    vector<Interval> merge(vector<Interval>& intervals) {
            vector<Interval>ret;
            if(intervals.size() < 1)return ret;
            sort(intervals.begin(),intervals.end(),myCmp);
            intervals.push_back(Interval(INT_MAX,INT_MAX));//add as mark end

            Interval cur = intervals[0];
            for(int i = 1;i < intervals.size();i++){
                //merge window if overlap
                if(cur.end >= intervals[i].start){
                    cur.start = min(cur.start,intervals[i].start);
                    cur.end = max(cur.end,intervals[i].end);
                }else{ //no overlap
                    ret.push_back(cur);
                    cur = intervals[i];
                }
            }
            return ret;
    }
};