LeetCode·56. Merge Intervals

题目：

56. Merge Intervals

Given a collection of intervals, merge all overlapping intervals.

Example 1:

Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:

Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considerred overlapping.

思路：

1.按左端值排序；
2.按序试探合并；

代码：

/**
 * 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> vec;
        int len = intervals.size();
        if(len < 2){
            for(auto &val:intervals)
                vec.push_back(val);
            return vec;
        }

        sort(intervals.begin(), intervals.end(), [](const Interval& a, const Interval& b) { return a.start < b.start; });

        int pre = 0, cur = 1;
        while(cur < len){
            for(; cur < len && intervals[pre].end >= intervals[cur].start; ++cur)
                intervals[pre].end = max(intervals[pre].end, intervals[cur].end);

            for(; cur < len && intervals[pre].end < intervals[cur].start; pre=cur, ++cur)
                vec.push_back(intervals[pre]);
        }
        vec.push_back(intervals[pre]);

        return vec;
    }
};

结果：