Leetcode 435. Non-overlapping Intervals | | Leetcode 435. Non-overlapping Intervals 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution1234567891011121314class Solution: def eraseOverlapIntervals(self, intervals): count = 0 if len(intervals) < 2: return count intervals.sort(key=lambda interval: interval[1]) overlap = intervals[0] for index in range(1, len(intervals)): if overlap[1] > intervals[index][0]: count += 1 else: overlap = intervals[index] return count Reference https://leetcode.com/problems/non-overlapping-intervals/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏