[leetcode] 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].
题意：
给了一堆没有重合的区间，插入一个新的区间，如果需要合并的话合并。区间已经按照左端进行了排序。
思路：
采用二分法去查找该区间应该插入的位置，并且也使用二分查找该区间的右端所在的区间（也有可能不存在，不存在就不需要合并）。比如上面的第二个例子，二分查找到[4,9]左端的4在[3,5]中，右端的9在区间[8,10]中，那么直接将[3,5]..[8,10]进行合并，合并为[3,10]。
以上。
代码如下：

 bool operator <(const Interval& a,const Interval& b){
     return a.start <= b.start;
 }
 bool myComp(const Interval& a,const Interval& b){
     return a.end <= b.end;
 }
class Solution {
public:
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
        if(intervals.size() == 0){
            intervals.push_back(newInterval);
            return intervals;
        }
        vector<Interval>::iterator iter_first = lower_bound(intervals.begin(),intervals.end(),newInterval);
        vector<Interval>::iterator iter_second = lower_bound(intervals.begin(),intervals.end(),newInterval,myComp);
        if(iter_first == intervals.end()){
            if(intervals[intervals.size() - 1].end < newInterval.start)
                intervals.push_back(newInterval);
            else if(intervals[intervals.size() - 1].end < newInterval.end)intervals[intervals.size() - 1].end = newInterval.end;
            return intervals;
        }
        else{
            vector<Interval> result;
            auto iter = intervals.begin();
            while(iter_first != intervals.begin() && (iter->end < newInterval.start || iter < iter_first - 1)){
                result.push_back(*iter);
                iter++;
            }
            if(iter_second == intervals.end()){
                if(iter_first != intervals.begin() && (iter_first-1)->end >= newInterval.start && (iter_first-1)->start < newInterval.start)newInterval.start = (iter_first-1)->start;
                result.push_back(newInterval);
                return result;
            }
            else if(iter_first == intervals.begin()){
               if(newInterval.end < iter_first->start){
                   result.push_back(newInterval);
                   auto iter = intervals.begin();
                   while(iter != intervals.end()){
                       result.push_back(*iter);
                       iter++;
                   }
                   return result;
               }
            }
            else{
                if((iter_first-1)->end >= newInterval.start)newInterval.start = (iter_first-1)->start;
            }
            if(newInterval.end >= iter_second->start){
                newInterval.end = iter_second->end;
                ++iter_second;
            }
            result.push_back(newInterval);
            while(iter_second != intervals.end()){
                result.push_back(*iter_second);
                ++iter_second;
            }
            return result;
        }
    }

};