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：给输出排序(输入是vector，可以利用泛型算法sort，但是Interval不可以直接比较，需要自定义sort第三个参数)

遍历输入，依次push_back到结果中,如果start大于res.back().end,就新增一个，如果start小于res.back().end,就将res.back().end赋值为max(res.back().end,end)

/**
 * 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:
    static bool comp(const Interval &left,const Interval &right){
        return left.start < right.start;
    }
    vector<Interval> merge(vector<Interval>& intervals) {
        vector<Interval> res;
        int n=intervals.size();
        sort(intervals.begin(),intervals.end(),comp);
        for(int i=0;i<n;i++){
            if(res.empty()||intervals[i].start>res.back().end){
                res.push_back(intervals[i]);
            }else{
                res.back().end=max(res.back().end,intervals[i].end);
            }
        }
        return res;
    }
};

如何自定义sort的第三个参数(1)要定义为静态函数(2)返回bool类型，小于为升序，大于为降序

https://blog.csdn.net/qq_31217423/article/details/76375336