LeetCode 452 Minimum Number of Arrows to Burst Balloons (贪心，排序)

There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array points where points[i] = [xstart, xend] denotes a balloon whose horizontal diameter stretches between xstart and xend. You do not know the exact y-coordinates of the balloons.

Arrows can be shot up directly vertically (in the positive y-direction) from different points along the x-axis. A balloon with xstart and xend is burst by an arrow shot at x if xstart <= x <= xend. There is no limit to the number of arrows that can be shot. A shot arrow keeps traveling up infinitely, bursting any balloons in its path.

Given the array points, 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: The balloons can be burst by 2 arrows:
- Shoot an arrow at x = 6, bursting the balloons [2,8] and [1,6].
- Shoot an arrow at x = 11, bursting the balloons [10,16] and [7,12].

Example 2:

Input: points = [[1,2],[3,4],[5,6],[7,8]]
Output: 4
Explanation: One arrow needs to be shot for each balloon for a total of 4 arrows.

Example 3:

Input: points = [[1,2],[2,3],[3,4],[4,5]]
Output: 2
Explanation: The balloons can be burst by 2 arrows:
- Shoot an arrow at x = 2, bursting the balloons [1,2] and [2,3].
- Shoot an arrow at x = 4, bursting the balloons [3,4] and [4,5].

Constraints:

• 1 <= points.length <= 10^5
• points[i].length == 2
• -2^31 <= xstart < xend <= 2^31 - 1

题目链接：https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/

题目大意：给一些气球在x轴的直径范围，可从x轴任意点沿着y轴方向射箭，射出的箭只会径直向前飞，遇到气球就会戳爆，问戳爆所有气球最少需要射几次箭

题目分析：按照左端点排序，贪心策略很明显：尽可能往覆盖多的地方射击，于是不断维护从当前段开始往后可覆盖的公共范围，若后一段无法被当前覆盖则将后一段作为新的起始段，继续往后计算

68ms，时间击败85.24%

class Solution {
    public int findMinArrowShots(int[][] points) {
        Arrays.sort(points, (p1, p2) -> Integer.compare(p1[0], p2[0]));
        int n = points.length, i = 0, ans = 0;
        // for (int j = 0; j < n; j++) {
        //     System.out.println(points[j][0] + " " + points[j][1]);
        // }
        while (i < n) {
            int l = points[i][0], r = points[i][1], j = i + 1;
            while (j < n && points[j][0] <= r && points[j][0] >= l) {
                r = Math.min(r, points[j][1]);
                l = points[j][0];
                j++;
            }
            i = j;
            ans++;
        }
        return ans;
    }
}