There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter and hence the x-coordinates of start and end of the diameter suffice. Start is always smaller than end. There will be at most 104 balloons.

An arrow can be shot up exactly vertically from different points along the x-axis. A balloon with xstart and xend bursts by an arrow shot at x if xstart ≤ x ≤ xend. There is no limit to the number of arrows that can be shot. An arrow once shot keeps travelling up infinitely. The problem is to find the minimum number of arrows that must be shot to burst all balloons.

Example:

Input:
[[10,16], [2,8], [1,6], [7,12]]

Output:
2

Explanation:
One way is to shoot one arrow for example at x = 6 (bursting the balloons [2,8] and [1,6]) and another arrow at x = 11 (bursting the other two balloons).

思路：
这题其实是让你找maximal disjoint intervals. 因为这些disjoint intervals 是不可能被同一支箭射中的。为了能够找到maximal disjoint intervals，我们可以用greedy的方法。

 1 class Solution {
 2     public int eraseOverlapIntervals(int[][] intervals) {
 3         if (intervals.length == 0) {
 4             return 0;
 5         }
 6 
 7         Arrays.sort(intervals, (interval1, interval2) -> interval1[1] - interval2[1]);
 8         int end = intervals[0][1];
 9         int count = 1;
10 
11         for (int i = 1; i < intervals.length; i++) {
12             if (intervals[i][0] >= end) {
13                 end = intervals[i][1];
14                 count++;
15             }
16         }
17         return intervals.length - count;
18     }
19 }