Leetcode 56. Merge Intervals (Hard) (cpp)

最新推荐文章于 2020-07-11 22:07:41 发布

Niko_Ke

最新推荐文章于 2020-07-11 22:07:41 发布

阅读量486

点赞数

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52889792

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

Leetcode 56. Merge Intervals (Hard) (cpp)

Tag: Array, Sort

Difficulty: Hard

/*

56. Merge Intervals (Hard)

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) {
        if (intervals.empty()) {
            return {};
        }
        sort(intervals.begin(), intervals.end(), [] (Interval a, Interval b) {return a.start < b.start;});
        vector<Interval> res;
        res.push_back(intervals[0]);
        int i = 0, j = 1;
        while (j < intervals.size()) {
            if (res[i].end >= intervals[j].start) {
                res[i].start = min(res[i].start, intervals[j].start);
                res[i].end = max(res[i].end, intervals[j].end);
                j++;
            } else {
                res.push_back(intervals[j++]);
                i++;
            }
        }
        return res;
    }
};