Leetcode: Non-overlapping Intervals

Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Note:
You may assume the interval‘s end point is always bigger than its start point.
Intervals like [1,2] and [2,3] have borders "touching" but they don‘t overlap each other.
Example 1:
Input: [ [1,2], [2,3], [3,4], [1,3] ]

Output: 1

Explanation: [1,3] can be removed and the rest of intervals are non-overlapping.
Example 2:
Input: [ [1,2], [1,2], [1,2] ]

Output: 2

Explanation: You need to remove two [1,2] to make the rest of intervals non-overlapping.
Example 3:
Input: [ [1,2], [2,3] ]

Output: 0

Explanation: You don‘t need to remove any of the intervals since they‘re already non-overlapping.

 1 /**
 2  * Definition for an interval.
 3  * public class Interval {
 4  *     int start;
 5  *     int end;
 6  *     Interval() { start = 0; end = 0; }
 7  *     Interval(int s, int e) { start = s; end = e; }
 8  * }
 9  */
10 public class Solution {
11     public int eraseOverlapIntervals(Interval[] intervals) {
12         if (intervals.length == 0) return 0;
13         int nonOverlap = 1;
14         int seq = 0;
15         Arrays.sort(intervals, new Comparator<Interval>() {
16             public int compare(Interval i1, Interval i2) {
17                 return i1.end - i2.end;
18             }
19         });
20         for (int i=1; i<intervals.length; i++) {
21             if (intervals[i].start >= intervals[seq].end) {
22                 seq = i;
23                 nonOverlap++;
24             }
25         }
26         return intervals.length - nonOverlap;
27     }
28 }