【leetcode】No.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.

思路：
维护一个期望加入答案列表的区间[left,right]，初始为第一个区间的值
遍历所有区间有两种情况
1）[left,right]与下一个区间不重叠(即:right < 下一个区间左端点时)，需要把[left,right]加入答案列表，且更新[left, right]为下一个区间的值
2）否则, 当前区间和下一个区间有重叠,更新right = max(right, 下一个区间右端点)
其他的还有要先对区间按左端点排序和初始时判断区间是否为空
参考代码:

bool cmp(Interval e1,Interval e2){
        if(e1.start == e2.start) return e1.end < e2.end;
        return e1.start < e2.start;
}
class Solution {
public:

    vector<Interval> merge(vector<Interval>& intervals) {
        vector<Interval> ans;
        if(!intervals.size()) return ans;
        sort(intervals.begin(), intervals.end(), cmp);

        int index = 0;
        int left = intervals[index].start;
        int right = intervals[index].end;
        while(index+1 < intervals.size()){
            if(right < intervals[index+1].start){
                ans.push_back(Interval(left, right));
                left = intervals[index+1].start;
                right = intervals[index+1].end;

            }else{
                right = max(right,intervals[index+1].end);
            }
            index++;
        }
        ans.push_back(Interval(left, right));
        return ans;
    }

};