【leetcode每日刷题】435. Non-overlapping Intervals

https://leetcode.com/problems/non-overlapping-intervals/

贪婪算法

import java.util.Arrays;
import java.util.Comparator;
class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        Arrays.sort(intervals, (a, b) -> a[1] - b[1]);
        int end = Integer.MIN_VALUE, cnt = 0;  //init end as intervals[0][1] other than 0, considering negative.
        for (int[] i : intervals) {
            if (i[0] >= end) {
                end = i[1];
                cnt++;
            }
        }
        return intervals.length - cnt;
    }
}