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

这个题目其实就是上一篇博客 Merge Intervals的变形

上代码

/**
 * 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:
    static bool comp(const Interval& i1,const Interval& i2)  
    {  
        return i1.start < i2.start;
    }
    vector<Interval> insert(vector<Interval> &intervals, Interval newInterval) {
        intervals.push_back(newInterval);
        sort(intervals.begin(),intervals.end(),comp);
        vector<Interval> result;
        result.push_back(intervals[0]);
        int j=0;
        for(int i=1;i<intervals.size();i++)
        {
            if(intervals[i].start<=result[j].end && intervals[i].end>result[j].end)
            {
                result[j].end=intervals[i].end;
            }
            else if(intervals[i].start>result[j].end)
            {
                result.push_back(intervals[i]);
                j++;
            }
        }
        return result;
    }
};