57. Insert Interval

problem：

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

策略是利用上一题中的想法，把新加入的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:
    static bool cmp(Interval& ina, Interval& inb)
    {
        return ina.start < inb.start;
    }
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval)
    {
        vector<Interval> result;
        intervals.push_back(newInterval);
        
        if(intervals.size() <= 1)
            return intervals;
        
        //排序
        sort(intervals.begin(),intervals.end(),cmp);
        //
        result.push_back(intervals[0]);
        for(int i=1; i<intervals.size(); i++)
        {
            Interval preIn = result.back();
            Interval curIn = intervals[i];
            
            //分三种情况
            if(curIn.start <= preIn.end && curIn.end > preIn.end)
            {
                preIn.end = curIn.end;
                result.pop_back();
                result.push_back(preIn);
            }
            else if(curIn.start > preIn.end)
            {
                result.push_back(curIn);
            }
            
        }
        return result;
    }
};