LeetCode--merge-intervals

题目描述

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) {}
 * };
 */
bool comp(const Interval &in1,const Interval &in2){
    if(in1.start==in2.start){
        return in1.end<in2.end;
    }else{
        return in1.start<in2.start;
    }
}
class Solution {
public:
    vector<Interval> merge(vector<Interval> &intervals) {
        sort(intervals.begin(),intervals.end(),comp); //按start升序排序
        vector<Interval> res;
        int len = intervals.size();
        for(int i=0;i<len;i++){
            if(res.empty()){
                res.push_back(intervals[i]);
            }else{
                Interval last = res.back();
                if(last.end>=intervals[i].start){ //需要进行合并
                    res.pop_back();
                    last.end = max(last.end,intervals[i].end);
                    res.push_back(last);
                }else{
                    res.push_back(intervals[i]);
                }
            }
        }
        return res;
    }
};