Insert 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 cmp(const Interval& lhs,const Interval& rhs)
{
    return lhs.start<rhs.start;
}
class Solution {
public:
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
        intervals.push_back(newInterval);
        vector<Interval> ans;
        int size = intervals.size();
        if(size == 0) return ans;
        sort(intervals.begin(),intervals.end(),cmp);
        
        Interval temp = intervals[0];
        for(int i = 1;i<size;i++)
        {
            if(intervals[i].start<=temp.start)
                temp.end = max(temp.end,intervals[i].end);
            else
            {
                ans.push_back(temp);
                temp = intervals[i];
            }
        }
        ans.push_back(temp);
        return ans;
    }
};

正确的答案：就像数学里线段一样，分几种情况去做

/**
 * 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> ans;
        for(int i = 0;i<intervals.size();i++)
        {
            if(intervals[i].end<newInterval.start)
                ans.push_back(intervals[i]);
            else if(intervals[i].start>newInterval.end)
            {    
                ans.push_back(newInterval);
                ans.insert(ans.end(),intervals.begin()+i,intervals.end());
                return ans;
            }
            else
            {
                newInterval.start = min(newInterval.start,intervals[i].start);
                newInterval.end = max(newInterval.end,intervals[i].end);
            }
        }
        ans.push_back(newInterval);
        return ans;
    }
};