打破气球所需的最少箭数

最新推荐文章于 2024-07-12 16:16:27 发布

weixin_33720452

最新推荐文章于 2024-07-12 16:16:27 发布

阅读量112

点赞数

文章标签： python 数据结构与算法

原文链接：https://my.oschina.net/liyurong/blog/1602679

版权

2019独角兽企业重金招聘Python工程师标准>>>

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 10^4 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).

解决：

一堆气球，X轴方向，有一个起始位置和结束位置。现在准备射箭打气球，问最少需要几只箭才能射破全部气球。

① 贪心算法，先将气球的范围排序，使用一个变量end指向当前这支箭能够指向的最大值（即当前范围的end），然后向后遍历，看当前end能否满足之后的范围，如果不满足，count + 1，更新end即可(注意不管是否满足，都要更新end)。

class Solution { //43ms
public int findMinArrowShots(int[][] points) {
if(points == null || points.length == 0) return 0;
Arrays.sort(points, new Comparator<int[]>() {
@Override
public int compare(int[] o1, int[] o2) {
if (o1[0] != o2[0]){
return o1[0] - o2[0];
}else {
return o1[1] - o2[1];
}
}
});
int count = 1;
int end = points[0][1];
for (int i = 1;i < points.length;i ++){
if (points[i][0] <= end){
end = Math.min(end,points[i][1]);
}else {
count ++;
end = points[i][1];
}
}
return count;
}
}