435. 无重叠区间 Krains 2020-07-28 11:26:10 贪心

class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        int count = 0;

        Arrays.sort(intervals, new Comparator<int[]>(){
            @Override
            public int compare(int[] a, int[] b){
                return a[1] - b[1];
            }
        });

        int end = Integer.MIN_VALUE;
        for(int i = 0; i < intervals.length; i++){
            if(end <= intervals[i][0]){
                end = intervals[i][1];
                count++;
            }
        }

        return intervals.length - count;
    }
}