452. Minimum Number of Arrows to Burst Balloons——排序+贪心算法
Posted 将者,智、信、仁、勇、严也。
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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 104 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).
class Solution(object): def findMinArrowShots(self, points): """ :type points: List[List[int]] :rtype: int """ points.sort(self.my_cmp) i = 0 length = len(points) ans = 0 while i<length: end = points[i][1] ans += 1 while i+1<length and points[i+1][0]<=end: end = min(end, points[i+1][1]) i += 1 i += 1 return ans def my_cmp(self, x1, x2): if x1[0] == x2[0]: return cmp(x1[1], x2[1]) else: return cmp(x1[0], x2[0])
以上是关于452. Minimum Number of Arrows to Burst Balloons——排序+贪心算法的主要内容,如果未能解决你的问题,请参考以下文章
452. Minimum Number of Arrows to Burst Balloons
452. Minimum Number of Arrows to Burst Balloons
[LeetCode] 452 Minimum Number of Arrows to Burst Balloons
[LC] 452. Minimum Number of Arrows to Burst Balloons