57. Insert Interval

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

You may assume that the intervals were initially sorted according to their start times.

Example 1:
Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].

Example 2:
Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].

This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].

【思路】先将新元素插入，再排序， 再合并。

/**
 * 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> insert(vector<Interval>& intervals, Interval newInterval) {
        vector<Interval> result;
        intervals.push_back(newInterval);
        sort(intervals.begin(), intervals.end(),cmp);
        int i ;
        Interval head = intervals[0];
        for(i = 1; i< intervals.size(); i++)
        {
            Interval tmp = intervals[i];
            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;
    }
};