452. Minimum Number of Arrows to Burst Balloons_given the array points, return the minimum number -CSDN博客

该博客介绍了如何通过排序和贪心算法解决LeetCode上的452题——《最少箭矢射爆气球》。题目要求找到最少的箭矢数来射爆所有气球，博主提供了一个简洁的解决方案：先按气球结束位置排序，然后从左到右依次射箭，当新的箭矢位置大于当前已射箭的位置时，才发射新的箭矢。通过这种方法，可以确保用最少的箭矢覆盖所有的气球范围。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

452. Minimum Number of Arrows to Burst Balloons

Medium

337898Add to ListShare

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 <= 105
points[i].length == 2
-231 <= xstart < xend <= 231 - 1

不会，看了答案。原文链接如下

https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/discuss/1686627/C++JavaPython-6-Lines-oror-Sort-and-Greedy-oror-Image-Explanation

class Solution:
    def findMinArrowShots(self, points: List[List[int]]) -> int:
        points.sort(key=lambda p: p[1])
        ans, arrow = 0, 0
        for [start, end] in points:
            if ans == 0 or start > arrow:
                ans, arrow = ans + 1, end
        return ans