435. Non-overlapping Intervals
一、问题描述
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals 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.
二、输入输出
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.
三、解题思路
贪心算法
- 这道题和之前那个扎气球Minimum Number of Arrows to Burst Balloons的非常相似,也是找到最少的,以便使得区间没有重叠。
- 我的做法是首先对这些区间进行排序,先按照start从小到大进行排序,如果start相同,再按照end从小到大进行排序。
- 遍历的时候,我们记录下现在已选区间中最后一个的end的位置,之后只需要比较cur.start 如果cur.start < lastPos 说明有重叠,这时需要删除一个区间。可以删除之前的区间,也可以删除现在遍历的这个区间,那么我们删除哪一个那?如果cur.end < lastPos 说明上一个区间完全包含了当前这个区间,那么我们为了给后面的区间流出足够大的空间,肯定是删除上一个区间而保留当前区间,因为当前区间的end 比较小,然后更新lastPos = cur.end。如果cur.end>lastPos 说明是部分重叠,那么只需要删除当前区间就行了,lastPos不变。
/**
* Definition for an interval.
* struct Interval {
* int start;
* int end;
* Interval() : start(0), end(0) {}
* Interval(int s, int e) : start(s), end(e) {}
* };
*/
class Solution {
public:
static bool Bigger(const Interval& x, const Interval& y){
if(x.start == y.start){
return (x.end < y.end);
}else{
return (x.start < y.start);
}
};
int eraseOverlapIntervals(vector<Interval>& intervals) {
if(intervals.size() == 0)return 0;
sort(intervals.begin(), intervals.end(), Bigger);
int ret = 0, lastPos = intervals[0].end;
for (int i = 1, n = intervals.size(); i < n; ++i) {
Interval cur = intervals[i];
if(cur.start < lastPos) {
ret++;
if(cur.end < lastPos)lastPos = cur.end;
}else{
lastPos = cur.end;
}
}
return ret;
}
};