地址:https://leetcode-cn.com/problems/non-overlapping-intervals/
给定一个区间的集合,找到需要移除区间的最小数量,使剩余区间互不重叠。
贪心算法:最先结束的区间,一定是最优解的一部分
Java 代码:
class Solution {
public int eraseOverlapIntervals(int[][] intervals) {
int len = intervals.length;
if (len < 2) {
return 0;
}
Arrays.sort(intervals, Comparator.comparingInt(a -> a[1]));
// 计算哪些区间被丢弃
int res = 0;
int end = intervals[0][1];
for (int i = 1; i < len; i++) {
if (intervals[i][0] < end) {
res++;
} else {
end = intervals[i][1];
}
}
return res;
}
}