NonOverlappingIntervals.java

class NonOverlappingIntervals {
    public int eraseOverlapIntervals(int[][] intervals) {
        Arrays.sort(intervals, (a, b) -> a[1] - b[1]);
        int erase = 0;
        int end = Integer.MIN_VALUE;
        for (int[] interval : intervals) {
            if (end > interval[0]) {
                erase++;
            } else {
                end = interval[1];
            }
        }
        return erase;
    }
}