leetcode-patterns-java/LeetCode_Problems/Java/medium/0435. Non-overlapping Intervals.java at main · elchibek5/leetcode-patterns-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {

        int n = intervals.length;
        Arrays.sort(intervals, (a, b) -> Integer.compare(a[1], b[1]));

        int overlap = 0;
        int lastEnd = intervals[0][1];

        for (int i = 1; i < n; i++) {
            if (lastEnd > intervals[i][0]) {
                overlap++;
            } else {
                lastEnd = intervals[i][1];
            }
        }

        return overlap;
    }

    // run: O(n log n)
    // space: O(1);
}