Leetcode 435 python 解题报告

class Solution(object):
def eraseOverlapIntervals(self, intervals):
"""
:type intervals: List[Interval]
:rtype: int
"""
if len(intervals) == 0:
return 0
intervals = sorted(intervals, key=lambda Interval: Interval.start)
prev = 0
count = 0
for i in range(1,len(intervals)):
if intervals[prev].end > intervals[i].start:
if intervals[prev].end > intervals[i].end:
prev = i
count += 1
else:
prev = i
return count