题目
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
Example 1:
Input: [[1,2],[2,3],[3,4],[1,3]]
Output: 1
Explanation: [1,3] can be removed and the rest of intervals are non-overlapping.
Example 2:
Input: [[1,2],[1,2],[1,2]]
Output: 2
Explanation: You need to remove two [1,2] to make the rest of intervals non-overlapping.
Example 3:
Input: [[1,2],[2,3]]
Output: 0
Explanation: You don’t need to remove any of the intervals since they’re already non-overlapping.
Note:
You may assume the interval’s end point is always bigger than its start point.
Intervals like [1,2] and [2,3] have borders “touching” but they don’t overlap each other.
贪心法
这题求可以去掉的重复区间数,那么可以转化为先求无重复区间数再用数组长度减去无重复区间数的长度。
求无重复区间:先对数组按列排序,如果区间尾下标比后面元素区间的头区间小,说明是无重复的,计数加1,然后继续遍历。
python代码
class Solution(object):
def eraseOverlapIntervals(self, intervals):
"""
:type intervals: List[List[int]]
:rtype: int
"""
if not intervals:
return 0
n = len(intervals)
intervals.sort(key = lambda x : x[1])
count=1
temp = intervals[0][1]
for i in range(1,n):
if intervals[i][0]>=temp:
count += 1
temp = intervals[i][1]
return n-count