LeetCode 435. Non-overlapping Intervals

题目

思路

贪心

代码

# Definition for an interval.
# class Interval:
#     def __init__(self, s=0, e=0):
#         self.start = s
#         self.end = e

class Solution:
    def eraseOverlapIntervals(self, intervals):
        """
        :type intervals: List[Interval]
        :rtype: int
        """
        intervals = sorted(intervals, key = lambda x: x.end)
        count = 0; i = 0
        end = 0
        while i < len(intervals):
            if i == 0:
                end = intervals[i].end
                count += 1
            if intervals[i].start >= end:
                end = intervals[i].end
                count += 1
            i += 1
        return len(intervals) - count