Leetcode223: 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 Interval那道题的延伸，可以利用那道题的思想，把newInterval插入到末尾然后使用Merge 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 comp(const Interval&a, const Interval& b)
{
    if(a.start == b.start)  return a.end<b.end;
    return a.start<b.start;
}
class Solution {
public:
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
        intervals.push_back(newInterval);
        sort(intervals.begin(), intervals.end(), comp);
        vector<Interval> res;  
        if(intervals.size()==0) return res;  
        int temp = intervals[0].end;  
        Interval s(intervals[0].start, temp);  
        for(int i = 1; i < intervals.size(); i++)  
        {  
            if(intervals[i].start > temp)   //相邻之间无重叠  
            {  
                s.end = temp;  
                res.push_back(s);  
                s.start = intervals[i].start;  
                temp = intervals[i].end;  
            }  
            else                            //有重叠，更新temp  
                temp = max(temp, intervals[i].end);  
        }  
        s.end = temp;  
        res.push_back(s);  
        return res;  
        
    }
};

改进的思路：

/**
 * 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 comp(const Interval&a, const Interval& b)
{
    if(a.start == b.start)  return a.end<b.end;
    return a.start<b.start;
}
class Solution {
public:
    vector<Interval> insert(vector<Interval>& intervals, Interval newInterval) {
        int n = intervals.size();
        vector<Interval> res;
        if(n == 0)  
        {
            res.push_back(newInterval);
            return res;
        }
        sort(intervals.begin(), intervals.end(), comp);
        int i = 0;
        bool is_add = false;
        for(; i < n; i++)
        {
            if(intervals[i].end < newInterval.start)    res.push_back(intervals[i]);
            else if(intervals[i].start > newInterval.end)
            {
                res.push_back(newInterval);
                is_add = true;
                break;
            }
            else
            {
                newInterval.start = min(intervals[i].start, newInterval.start);
                newInterval.end = max(intervals[i].end, newInterval.end);
            }
        }
        if(!is_add) res.push_back(newInterval);
        for(; i<n; i++)
            res.push_back(intervals[i]);
        return res;
    }
};