思路1 贪心

  • 时间复杂度 O(n * logn)

  • 空间复杂度 O(1)

贪心法, 每个气球只少需要一支箭, 先按照右端点排序,

Previous0452_Minimum_Number_of_Arrows_to_Burst_BalloonsNext0453_Minimum_Moves_to_Equal_Array_Elements

Last updated

Was this helpful?