合并区间 Merge Intervals

https://leetcode.com/problems/merge-intervals/

先对区间按照左边界排序，然后顺序扫描，合并重叠的区间即可。

/**
 * 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:
    struct cmp{
        bool operator()(const Interval a, const Interval b)const{
            return a.start < b.start;
        }
    };

    vector<Interval> merge(vector<Interval>& intervals) {
        int len = intervals.size();
        if (len == 0)
            return intervals;
        sort(intervals.begin(), intervals.end(), cmp());
        vector<Interval> res;
        res.push_back(intervals[0]);

        for (int i = 1; i < len; i++){
            Interval& back = res.back();//引用

            if (intervals[i].start <= back.end){//=也算重合
                //back.end = intervals[i].end;
                back.end=max(back.end,intervals[i].end);//
            }
            else{
                res.push_back(intervals[i]);
            }

        }
        return res;
    }
};