Non-overlapping Intervals LeetCode solution in Java

1
// |-------|
2
//   |--|
3

4
// |-------|
5
// .   |-------|
6

7
// |-------|
8
// .           |-------|
9

10
class Solution {
11
  public int eraseOverlapIntervals(int[][] intervals) {
12
    Arrays.sort(intervals, (a, b) -> a[0] - b[0]);
13

14
    int start = intervals[0][0];
15
    int end = intervals[0][1];
16
    int res = 0;
17

18
    for (int i = 1; i < intervals.length; i++) {
19
      int[] interval = intervals[i];
20

21
      if (interval[0] >= start && interval[0] < end) {
22
        res++;
23
        if (interval[1] >= end) continue;
24
      }
25
      start = interval[0];
26
      end = interval[1];
27
    }
28

29
    return res;
30
  }
31
}