435. Non-overlapping Intervals

题目

Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

 

Example 1:

Input: intervals = [[1,2],[2,3],[3,4],[1,3]]
Output: 1
Explanation: [1,3] can be removed and the rest of the intervals are non-overlapping.

Example 2:

Input: intervals = [[1,2],[1,2],[1,2]]
Output: 2
Explanation: You need to remove two [1,2] to make the rest of the intervals non-overlapping.

Example 3:

Input: intervals = [[1,2],[2,3]]
Output: 0
Explanation: You don't need to remove any of the intervals since they're already non-overlapping.

 

Constraints:

• 1 <= intervals.length <= 2 * 104
• intervals[i].length == 2
• -2 * 104 <= starti < endi <= 2 * 104

解法

def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
    start=end=float('-inf')
    num=0
    intervals.sort(key=lambda x:x[0])
    for interval in intervals:
        if(interval[0])>=end:
            end=interval[1]
        else:
            end=min(interval[1],end)
            num+=1
    return num