1272. Remove Interval.md

1272. Remove Interval

https://leetcode.com/problems/remove-interval/

Given a sorted list of disjoint intervals, each interval intervals[i] = [a, b] represents the set of real numbers x such that a <= x < b.

We remove the intersections between any interval in intervals and the interval toBeRemoved.

Return a sorted list of intervals after all such removals.

Example 1:

Input: intervals = [[0,2],[3,4],[5,7]], toBeRemoved = [1,6]
Output: [[0,1],[6,7]]

Example 2:

Input: intervals = [[0,5]], toBeRemoved = [2,3]
Output: [[0,2],[3,5]]

Example 3:

Input: intervals = [[-5,-4],[-3,-2],[1,2],[3,5],[8,9]], toBeRemoved = [-1,4]
Output: [[-5,-4],[-3,-2],[4,5],[8,9]]

Constraints:

• 1 <= intervals.length <= 10^4
• -10^9 <= intervals[i][0] < intervals[i][1] <= 10^9

代码

class Solution(object):
    def removeInterval(self, intervals, toBeRemoved):
        """
        :type intervals: List[List[int]]
        :type toBeRemoved: List[int]
        :rtype: List[List[int]]
        """
        intervals.sort(key = lambda x: x[1])
        A, B = toBeRemoved[0], toBeRemoved[1]
        res = []
        for a, b in intervals:
            if b <= A or a >= B:
                res.append([a,b])
                continue
            if A < b <= B:
                if a >= A:
                    continue
                else:
                    res.append([a, A])
            elif a < B < b:
                if a < A:
                    res.append([a, A])
                res.append([B, b])

        return res