题:
题目
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.
思路
题目大意
在区间集合中,除去最少的区间,使得剩下的 区间不重合。
解题思路
贪心算法。
从时间轴的角度看,若存在最优 区间组合,那么 对于任意一个区间位置,若存在一个另一个区间,该时刻可以放进该区间位置,那它的 end时间越小,对后面的剩下的空间越大。同是最优组合。
或这样想。
按时间选一个区间,这个区间能放入区间集合,若该区间的end时间最小,那么后面可供选择的 区间就越多,越可能是最优解。
code
/**
* Definition for an interval.
* public class Interval {
* int start;
* int end;
* Interval() { start = 0; end = 0; }
* Interval(int s, int e) { start = s; end = e; }
* }
*/
class Solution {
public int eraseOverlapIntervals(Interval[] intervals) {
if(intervals.length == 0) return 0;
Arrays.sort(intervals, new Comparator<Interval>() {
@Override
public int compare(Interval o1, Interval o2) {
return o1.end - o2.end;
}
});
int cnt = 1;
int cur_end = intervals[0].end;
for(int i = 1 ; i < intervals.length ; i++){
if(intervals[i].start < cur_end) continue;
cur_end = intervals[i].end;
cnt++;
}
return intervals.length-cnt;
}
}