57. 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:

Input: intervals = [[1,3],[6,9]], newInterval = [2,5]
Output: [[1,5],[6,9]]

Example 2:

Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]
Output: [[1,2],[3,10],[12,16]]

Explanation: Because the new interval [4,8] overlaps with [3,5],[6,7],[8,10].

花花酱： https://www.youtube.com/watch?v=oWHWDI2eOHY&t=50s
grandyang：http://www.cnblogs.com/grandyang/p/4367569.html

方法1：

思路：

这道题已经sort好了，所以只要把新区间插入到正确位置，就可以调用56题的函数进行merge。由于input是vector，插入的时间复杂度将可能是O(n)，比较费时。

Complexity

Time complexity: O(n)
Space complexity: O(n)

方法2:

思路：

这道题只需要找到所有和新数组相交的区间，进行合并，把其他不相交的区间原样放入结果就可以了。通过扫描所有区间，判断以下几点：

1. interval和新区间a不相交的条件: interval.end < a.end || interval.start > a.end。直接放进result
2. interval和新区间a不相交的条件：非以上情况。这时要开始一个while 循环，直到下一个符合上述特征的区间出现，之后的区间都不再相交。对于这这个循环里的每一个区间，用min确定起点，用max确定终点。

Iterator 的写法：

易错点

1. iterator是指针，需要用 ->
2. vector::insert(position, newInterval), position 可以用指针标示
3. 如果集合为空，应该返回newInterval

Complexity

Time complexity: O(n)
Space complexity: O(n)

/**
 * 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) {
        if (intervals.empty()) return {newInterval};
        vector<Interval> result;
        vector<Interval>::iterator it = intervals.begin();
        int cur = 0;
        
        while (it != intervals.end()){
            if (it->end < newInterval.start){
                result.push_back(*it);
                cur ++;
            }
            else if (newInterval.end < it->start){
                result.push_back(*it);
            }
            else {
                newInterval.start = min(newInterval.start, it -> start);
                newInterval.end = max(newInterval.end, it -> end);
            }
            it ++;
        }
        result.insert(result.begin() + cur, newInterval);
        return result;
    }
};

因为要把新区间放进去可能花时间，把循环打断成前后两个部分，但是也没有变快：

/**
 * 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) {
        if (intervals.empty()) return {newInterval};
        vector<Interval> result;
        
        int cur = 0;
        
        // 左边的，融合新区间
        while (cur < intervals.size()){
            if (intervals[cur].end < newInterval.start){
                result.push_back(intervals[cur]);
            }
            else if (newInterval.end < intervals[cur].start) {
                break;
            }
            else{
                newInterval.start = min(newInterval.start, intervals[cur].start);
                newInterval.end = max(newInterval.end, intervals[cur].end);
            }
            cur ++;
        }
        // 新区间
        result.push_back(newInterval);
        
        // 右边的
        while (cur < intervals.size()){
            result.push_back(intervals[cur++]);
        }
        return result;
    }
};

干脆打成三个部分，就很清晰：

/**
 * 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) {
        if (intervals.empty()) return {newInterval};
        vector<Interval> result;
        
        int cur = 0;
        
        // 左边的
        while (cur < intervals.size() && intervals[cur].end < newInterval.start){
                result.push_back(intervals[cur++]);
        }    
        // 新区间
        while (cur < intervals.size() && newInterval.end >= intervals[cur].start) {
            newInterval.start = min(newInterval.start, intervals[cur].start);
            newInterval.end = max(newInterval.end, intervals[cur].end);
            cur ++;
        }
        result.push_back(newInterval);
        
        // 右边的
        while (cur < intervals.size()){
            result.push_back(intervals[cur++]);
        }
        return result;
    }
};

用iterator，可以做到原位修改intervals。慢的不行？？？？

class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        vector<vector<int>> res;
        auto it = lower_bound(intervals.begin(), intervals.end(), vector<int> ({newInterval[0], newInterval[0]}));
        if (it != intervals.begin()) it--;
        while (it != intervals.end() && (*it)[0] <= newInterval[1]) {
            if ((*it)[0] <= newInterval[1] && (*it)[1] >= newInterval[0] ) {
                newInterval[0] = min(newInterval[0], (*it)[0]);
                newInterval[1] = max(newInterval[1], (*it)[1]); 
                intervals.erase(it);
            }
            else it++;
        }
        intervals.insert(it, newInterval);
        return intervals;
    }
};