1.无重叠区间

435. 无重叠区间 - 力扣（LeetCode）

思路：

 代码：

class Solution {public static   int eraseOverlapIntervals(int[][] intervals) {Arrays.sort(intervals,(v1,v2)->{return v1[0]-v2[0];});int left = intervals[0][0],right = intervals[0][1],count = 0;for(int i = 1; i < intervals.length; i++){int a = intervals[i][0],b = intervals[i][1];if(a >= right){right = b;}else{count++;right = Math.min(right,b);}}return count;}
}