Insert Intervals---LeetCode

又刷了一道算法题——Insert Intervals，原题链接Insert Intervals，显示为hard，但是我觉得很简单，并没有达到hard等级，哈哈，小小的装一个逼啊。原题如下：

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

建议大家先看一下我的上一篇博客 Merge Intervals--LeetCode，那道题做完之后会觉得这道题没什么难度，思路就是先Insert，然后merge，Insert的方式就是按照Interval.start的成员插入，插完之后就是一个按照start成员排好序的区间序列，然后调用merge函数，就行了，merge详见 Merge Intervals--LeetCode，最后还是贴代码：

class Solution {
    private:
    int i;
    
public:
    
    static bool compare(const Interval&a,const Interval&b){
        return a.start<b.start;
    }
    
    static vector<Interval>merge(vector<Interval>&intervals){
        vector<Interval> result;
        result.push_back(intervals[0]);
	    for (int i = 1; i < intervals.size(); i++) {
		    if (intervals[i].start <=result.back().end) {
			    result.back().end = max(result.back().end, intervals[i].end);
		    }
		    else
			    result.push_back(intervals[i]);
	    }
	    return result;
    }
    
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
        vector<Interval>result;
        if(intervals.empty()){
            result.push_back(newInterval);
            return result;
        }
        for(i=0;i<intervals.size();i++){
            if(intervals[i].start>newInterval.start)
                break;
        }
        intervals.insert(intervals.begin()+i,newInterval);
        return merge(intervals);
    }
};