Non-overlapping Intervals

1public int eraseOverlapIntervals(int[][] intervals) {
2    if (intervals.length == 0) return 0;
3    Arrays.sort(intervals, (a, b) -> Integer.compare(a[1], b[1]));
4    int end = intervals[0][1];
5    int count = 0;
6    for (int i = 1; i < intervals.length; i++) {
7        int[] current = intervals[i];
8        if (current[0] < end) {
9            count++;
10        } else {
11            end = current[1];
12        }
13    }
14    return count;
15}