插入区间Insert Interval

https://leetcode.com/problems/insert-interval/

参考 http://blog.csdn.net/linhuanmars/article/details/22238433

基本思路就是先扫描走到新的interval应该插入的位置，接下来就是插入新的interval并检查后面是否冲突，一直到新的interval的end小于下一个interval的start，然后取新interval和当前interval中end大的即可。因为要进行一次线性扫描，所以时间复杂度是O(n)。

/**
 * 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) {
         int len = intervals.size();
         vector<Interval> res;
         if (len == 0){
             res.push_back(newInterval);
             return res;
         }

         int i;
         for ( i= 0; i < len; i++){
             if (intervals[i].end < newInterval.start){
                 res.push_back(intervals[i]);
             }
             else
                 break;
         }

         if (i < len){
             newInterval.start = min(newInterval.start, intervals[i].start);
         }


         for (; i < len; i++){
             if (newInterval.end>=intervals[i].start){
                 newInterval.end = max(newInterval.end, intervals[i].end);
             }
             else
                 break;
         }

         res.push_back(newInterval);

         for (; i < len; i++){
             res.push_back(intervals[i]);
         }
         return res;
     }
 };