452. Minimum Number of Arrows to Burst Balloons

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).

首先按照起点升序排列气球，起点相同的按照终点升序排列。初始化一个end为points[0][1]，之后从第二个开始遍历，如果当前点的起点大于end，说明有间隔，需要多一支箭，箭数加一，并且end等于当前的终点。如果当前点的起点小于等于end，说明当前箭能穿过这个气球，如果当前气球的终点小于end，end等于当前点的终点。代码如下：

public class Solution {
    public int findMinArrowShots(int[][] points) {
        if (points.length == 0) {
            return 0;
        }
        Arrays.sort(points, new Comparator<int[]>(){
            @Override
            public int compare(int[] p1, int[] p2) {
                return p1[0] != p2[0]? p1[0] - p2[0]: p1[1] - p2[1];
            }
        });
        int end = points[0][1];
        int arrows = 1;
        for (int i = 1; i < points.length; i ++) {
            int[] p = points[i];
            if (p[0] > end) {
                arrows ++;
                end = p[1];
                continue;
            }
            if (p[1] < end) {
                end = p[1];
            }
        }
        return arrows;
    }
}