56. 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].

【思路】首先必须对区间按照左边元素的大小进行排序，然后对排序后的数组进行遍历，合并。能够合并的区间必须符合 a.begin <=b.begin  <= a.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 cmp(Interval a, Interval b){
        return (a.start) < (b.start);
    }
    vector<Interval> merge(vector<Interval>& intervals) {
        vector<Interval> result;
        if (intervals.size()<=1)   
            return  intervals;  
        sort(intervals.begin(), intervals.end(), cmp);
        int  j;
        Interval head = intervals[0];
        for(j =1; j < intervals.size(); j++)
        {  
          Interval tmp = intervals[j];
          if(tmp.start > head.end)
            {
                 result.push_back(head);
                 head = tmp;
                 continue;
              }else
              {
                 head.end = max(tmp.end, head.end);
              }
           }
            result.push_back(head);
        return result;
    }
};