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:
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
       vector<Interval> res;
       int i=0;
       for(;i<intervals.size();i++){
           if(newInterval.start>intervals[i].end)
               res.push_back(intervals[i]);
           else if(newInterval.end<intervals[i].start)
                    break;
           else{
               newInterval.start=min(intervals[i].start,newInterval.start);
               newInterval.end=max(intervals[i].end,newInterval.end);
           }
       }
        res.push_back(newInterval);
        for(;i<intervals.size();i++)
            res.push_back(intervals[i]);
        return res;    
    }
};