LeetCode.452 Minimum Number of Arrows to Burst Balloons（最少的箭射泡泡）

1.题目

There are some 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. The start is always smaller than the end.

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 traveling up infinitely.

Given an array points where points[i] = [xstart, xend], return the minimum number of arrows that must be shot to burst all balloons.


Example 1:

Input: points = [[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).
Example 2:

Input: points = [[1,2],[3,4],[5,6],[7,8]]
Output: 4
Example 3:

Input: points = [[1,2],[2,3],[3,4],[4,5]]
Output: 2
Example 4:

Input: points = [[1,2]]
Output: 1
Example 5:

Input: points = [[2,3],[2,3]]
Output: 1
 

Constraints:

0 <= points.length <= 104
points[i].length == 2
-231 <= xstart < xend <= 231 - 1

2.Explanation

• 只要保证泡泡的末尾按照一定的顺序排列，即可用最少的箭射击最多的泡泡，例如下面图解（用0代表泡泡，整个贯穿5组泡泡，需要2箭(第1箭在index=6，第2箭在index=11)）
  | 00000
  | 000000
  | 0000000
  | -------------0000
  | --------000000000
• 代码：

class Solution {
    public int findMinArrowShots(int[][] points) {
        // 思路：对泡泡排好序，按照end的升序排列即可。判断末尾的交集有多少个，则就是arrow的数量
        if (points == null || points.length == 0) {
            return 0;
        }

        Arrays.sort(points, Comparator.comparingInt(o -> o[1]));
        int end = points[0][1];
        int arrow = 1;
        for (int i = 1; i < points.length; i++) {
            if (end < points[i][0]) {
                end = points[i][1];
                arrow++;
            }
        }
        return arrow;
    }
}