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

解法1：从头到尾扫描，找到插入点。运行时间592ms

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s), end(e) {}
 * };
 */
vector<Interval> insert1(vector<Interval>& intervals, Interval newInterval) {
        vector<Interval> res;
        if(intervals.size()==0){ res.push_back(newInterval);return res;}
        Interval tmp(newInterval.start,newInterval.end);
        int i=0;
        while(i<intervals.size()&&intervals[i].end<newInterval.start)
        {
                res.push_back(intervals[i]);
                i++;
        }
        for(;i<intervals.size()&&intervals[i].start<=newInterval.end;i++)
        {
            tmp.start=intervals[i].start<tmp.start?intervals[i].start:tmp.start;
            tmp.end=intervals[i].end>tmp.end?intervals[i].end:tmp.end;
        }
        res.push_back(tmp);
        while(i<intervals.size()&&intervals[i].start>newInterval.end)
        {
            res.push_back(intervals[i]);
            i++;
        }

        return res;
    }

解法2：利用merge interval（上一道题）的函数。将新的元素插入到数组中，整体一起merge。运行时间604ms

class Solution {
public:
   vector<Interval> insert2(vector<Interval>& intervals, Interval newInterval){
        intervals.push_back(newInterval);
        return merge(intervals);
    }
private:
vector<Interval> merge(vector<Interval>& intervals) {
        vector<Interval> res;
        if(intervals.size()==0)
        {
            return res;
        }
        sort(intervals.begin(),intervals.end(),cmp);
        Interval tmp=intervals[0];
        for(int i=1;i<intervals.size();i++)
        {
           if(tmp.end<intervals[i].start)
           {
               res.push_back(tmp);
               tmp=intervals[i];
           }else
           {
               tmp.end=tmp.end<intervals[i].end?intervals[i].end:tmp.end;
           }
               
        }
        res.push_back(tmp);
        return res;
    }
private:
    static bool cmp(Interval& l1,Interval& l2)
    {
        return l1.start!=l2.start?l1.start<l2.start:l1.end<l2.end;
    }