Description

You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval newInterval = [start, end] that represents the start and end of another interval.

Insert newInterval into intervals such that intervals is still sorted in ascending order by starti and intervals still does not have any overlapping intervals (merge overlapping intervals if necessary).

Return intervals after the insertion.

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

Constraints:

• 0 <= intervals.length <= 104
• intervals[i].length == 2
• 0 <= starti <= endi <= 105
• intervals is sorted by starti in ascending order.
• newInterval.length == 2
• 0 <= start <= end <= 105

Solutions

Solution 1

Intuition

1. left: end < newStart
2. covered: newStart = min(start, newStart); find the last start which is smaller than newEnd, and update newEnd = max(end, newEnd);
3. right: the rest part of intervals

Code

class Solution {
    public:
    vector<vector<int>> insert(vector<vector<int>>& intervals, vector<int>& newInterval) {
        int n = intervals.size();
        vector<vector<int>> res;
        int idx = 0;
        while (idx < n && intervals[idx][1] < newInterval[0]) res.push_back(intervals[idx++]);

        if (idx < n) {
            newInterval[0] = min(intervals[idx][0], newInterval[0]);
            while (idx < n && intervals[idx][0] <= newInterval[1])
                newInterval[1] = max(intervals[idx++][1], newInterval[1]);
        }
        res.push_back(newInterval);
        while (idx < n) res.push_back(intervals[idx++]);

        return res;
    }
};

Complexity

• Time: O(n)
• Space: O(n)