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.

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.

Note:

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

思路：

sort by staring time => the minimum number of intervals to cover the whole range.

sort by end time => the maximum number of intervals that non-overlap;

按照end sort之后，取排序最左边的end，为什么，因为这样取，影响对后面的interval影响最少，这是greedy的思想；

class Solution {
    public int eraseOverlapIntervals(int[][] intervals) {
        Arrays.sort(intervals, (a, b) ->(a[1] - b[1]));
        int i = 0;
        int count = 0; // count picked up interval;
        while(i < intervals.length) {
            int j = i + 1;
            while(j < intervals.length && intervals[j][0] < intervals[i][1]) {
                j++;
            }
            count++;
            i = j;
        }
        return intervals.length - count;
    }
}