class Solution:
def eraseOverlapIntervals(self, intervals: List[List[int]]) -> int:
intervals.sort(key=lambda x:x[0])
res = 0
for i in range(1,len(intervals)):
if intervals[i][0] < intervals[i-1][1]:
res += 1
intervals[i][1] = min(intervals[i-1][1],intervals[i][1])
return res
435.无重叠区间
最新推荐文章于 2024-07-15 22:10:26 发布