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

思考：与Merge Interval一样。

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
 bool comp(const Interval &a,const Interval &b)
{
    return a.start<b.start;
}
class Solution {
public:
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
		vector<Interval> ret;
		intervals.push_back(newInterval);
		sort(intervals.begin(),intervals.end(),comp);
		int len=intervals.size();
		if(len==1) return intervals;
		int left=intervals[0].start;
		int right=intervals[0].end;
		for(int i=1;i<len;i++)
		{
			if(intervals[i].start<=right)
				right=max(right,intervals[i].end);
			if(intervals[i].start>right)
			{
				ret.push_back(Interval(left,right));
				left=intervals[i].start;
				right=intervals[i].end;
			}
			if(i==len-1)
			{
		    	ret.push_back(Interval(left,right));
			}
		}
		return ret;
    }
};