leetcode 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].
NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

• 从左到右处理分三步：

1. 直接添加在目标区间左边的
2. 合并和目标区间重合的
3. 直接添加在目标区间右边的

• 时间复杂度 $O(n)$

class Solution {
public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        vector<vector<int>> res;
        int n=intervals.size();
        int i;
        for(i=0;i<n;i++){
            if(intervals[i][1]<newInterval[0])
                res.push_back(intervals[i]);
            else break;
        }
        vector<int> tmp=newInterval;
        for(;i<n;i++){
            if(intervals[i][1]>=newInterval[0])
                tmp[0]=min(tmp[0],intervals[i][0]);
            if(intervals[i][0]<=newInterval[1])
                tmp[1]=max(tmp[1],intervals[i][1]);
            if(intervals[i][0]>newInterval[1])
                break;
        }
        res.push_back(tmp);
        for(;i<n;i++)
            res.push_back(intervals[i]);
        return res;
    }
};