# LeetCode 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 10000 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).

## 解法分析

假设现在有6个活动，下面是6个活动的起始和结束时间。
start[]  =  {1, 3, 0, 5, 8, 5};
finish[] =  {2, 4, 6, 7, 9, 9};

{0, 1, 3, 4}

## 解题代码

    public int findMinArrowShots(int[][] points) {
if (points == null || points.length == 0 || points[0].length == 0) {
return 0;
}
Arrays.sort(points, new Comparator<int[]>() {
public int compare(int[] a, int[] b) {
return a[1] - b[1];
}
});

long lastEnd = Long.MIN_VALUE;
int minArrows = 0;
for (int i = 0; i < points.length; i++) {
if (lastEnd < points[i][0]) {
lastEnd = points[i][1];
minArrows++;
}
}
return minArrows;
}
• 本文已收录于以下专栏：

## [leetcode] 312. Burst Balloons 解题报告

• qq508618087
• 2016年05月13日 15:35
• 2100

## leetcode 452

ublic class Solution {     public int findMinArrowShots(int[][] points) {         //贪心思路，选取最能够射到最多...
• qq344577073
• 2017年03月03日 12:52
• 122

## LeetCode 452. Minimum Number of Arrows to Burst Balloons

LeetCode 452. Minimum Number of Arrows to Burst Balloons
• luzheqi
• 2016年11月11日 16:09
• 973

## Leetcode 452. Minimum Number of Arrows to Burst Balloons

• xclfafa
• 2017年09月17日 16:17
• 60

## leetcode 452. Minimum Number of Arrows to Burst Balloons

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided...
• huanghanqian
• 2017年07月22日 14:18
• 120

## [leetcode]452. Minimum Number of Arrows to Burst Balloons

• xiaocong1990
• 2017年01月16日 13:28
• 161

## LeetCode 242. Valid Anagram 题解（C++）

Given two strings s and t, write a function to determine if t is an anagram of s.
• prayyojay
• 2016年10月19日 13:43
• 255

## [LeetCode]452. Minimum Number of Arrows to Burst Balloons

https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/?tab=Description 给定圆形气球的直径...
• gqk289
• 2017年02月18日 20:31
• 152

## 【LeetCode】 452. Minimum Number of Arrows to Burst Balloons

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided...
• qq_31129455
• 2017年01月09日 13:38
• 140

## 【LeetCode】452. Minimum Number of Arrows to Burst Balloons

• gmr_vhp
• 2017年05月11日 20:53
• 73

举报原因： 您举报文章：LeetCode 452. Minimum Number of Arrows to Burst Balloons 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)