57. Insert Interval

最新推荐文章于 2022-06-15 11:43:15 发布

Sterben_Da

最新推荐文章于 2022-06-15 11:43:15 发布

阅读量97

点赞数

分类专栏： leetcode-python 文章标签： python 算法 leetcode

本文链接：https://blog.csdn.net/Sterben_Da/article/details/115877689

版权

leetcode-python 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

57. Insert Interval

Medium

2792244Add to ListShare

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

Example 3:

Input: intervals = [], newInterval = [5,7]
Output: [[5,7]]

Example 4:

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

Example 5:

Input: intervals = [[1,5]], newInterval = [2,7]
Output: [[1,7]]

Constraints:

0 <= intervals.length <= 104
intervals[i].length == 2
0 <= intervals[i][0] <= intervals[i][1] <= 105
intervals is sorted by intervals[i][0] in ascending order.
newInterval.length == 2
0 <= newInterval[0] <= newInterval[1] <= 105

class Solution:
    def insert(self, intervals: List[List[int]], newInterval: List[int]) -> List[List[int]]:
        """
        搞了好久没做出来，以为左右2个数二分搜索，没想到条件好复杂。看了别人的题解，时间复杂度：O(n)
        
        print(Solution().insert([[1, 3], [6, 9]], [2, 5]))
        print(Solution().insert([[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]], [4, 8]))
        print(Solution().insert([], [5, 7]))
        print(Solution().insert([[1, 5]], [0, 3]))
        print(Solution().insert([[1, 5]], [2, 3]))
        print(Solution().insert([[1, 5]], [2, 7]))
        print(Solution().insert([[1, 2], [4, 5], [8, 10], [12, 16]], [3, 6]))
        print(Solution().insert([[1, 2], [3, 4], [8, 10], [12, 16]], [5, 6]))
        """

        # 用例 [[1, 2], [3, 5], [6, 7], [8, 10], [12, 16]], [4, 8]
        result = []
        i = 0
        while i < len(intervals) and intervals[i][1] < newInterval[0]:
            # 区间段右边比要插入的区间段的左边还小 [[1, 2]]
            result.append(intervals[i])
            i += 1

        while i < len(intervals) and intervals[i][0] <= newInterval[1]:
            # 把重叠的部分区间合并 [3, 10]
            newInterval[0] = min(intervals[i][0], newInterval[0])
            newInterval[1] = max(intervals[i][1], newInterval[1])
            i += 1

        # [[1, 2], [3, 10]]
        result.append(newInterval)

        # [[1, 2], [3, 10], [12, 16]]
        while i < len(intervals):
            result.append(intervals[i])
            i += 1

        return result