leetcode刷题_OJ 56

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.

主要的意思就是将有混叠的区间进行合并，将合并的区间输出即可。具体的解决办法：先用sort进行预处理，然后for循环遍历比较前一个的end与后一个start的大小，前者大则达到混叠区间的要求。此时注意是用while来循环判断end与start的大小，否则无法完成全部混叠区间的合并。将得出的最大end与start成对放入结构体即可。

/**
 * 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) {
        sort(intervals.begin(),intervals.end(),[](const Interval& l,const Interval& r){
        	return l.start<r.start;
        });
        vector<Interval> res;
        for(int i=0;i<intervals.size();){
        	int j=i+1;
        	int l_end=intervals[i].end;
        	while(j<intervals.size() && intervals[j].start<=l_end){//一开始是if，并没有覆盖全部的范围
        		l_end=max(l_end,intervals[j++].end);
        	}
        	res.push_back(Interval(intervals[i].start,l_end));
        	i=j;
        }
        return res;
    }
};