class Solution {
public int eraseOverlapIntervals(int[][] intervals) {
Arrays.sort(intervals,(a,b)->{
return Integer.compare(a[0],b[0]);
});
int count = 0;
int min = intervals[0][1];
for(int i = 1; i < intervals.length;i++){
if(min > intervals[i - 1][1]) min = intervals[i - 1][1];
if(intervals[i][0] >= min){
count++;
min = intervals[i][1];
}
}
int res = intervals.length - count - 1;
return res;
}
}
寻找不重叠的区间,找到之后总区间个数-不重叠区间个数即可。