# LeetCode 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 10000 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).

## 解法分析

假设现在有6个活动，下面是6个活动的起始和结束时间。
start[]  =  {1, 3, 0, 5, 8, 5};
finish[] =  {2, 4, 6, 7, 9, 9};

{0, 1, 3, 4}

## 解题代码

    public int findMinArrowShots(int[][] points) {
if (points == null || points.length == 0 || points[0].length == 0) {
return 0;
}
Arrays.sort(points, new Comparator<int[]>() {
public int compare(int[] a, int[] b) {
return a[1] - b[1];
}
});

long lastEnd = Long.MIN_VALUE;
int minArrows = 0;
for (int i = 0; i < points.length; i++) {
if (lastEnd < points[i][0]) {
lastEnd = points[i][1];
minArrows++;
}
}
return minArrows;
}

04-10 1009
04-06 350
11-24 375
08-04 50
06-09 52
11-18 275
10-25 67