题目:
我的解法:贪心
class Solution {
public int eraseOverlapIntervals(int[][] intervals) {
if(intervals.length==0){
return 0;
}
Arrays.sort(intervals, new Comparator<int[]>(){
public int compare(int[] interval1, int[] interval2){
return interval1[1]-interval2[1];
}
});
int num = 1;
int right = intervals[0][1];
for(int i=0; i<intervals.length; i++){
if(intervals[i][0]>=right){
right = intervals[i][1];
num++;
}
}
return intervals.length-num;
}
}
官方题解: