452. Minimum Number of Arrows to Burst Balloons Java解法
来源:互联网 发布:smartgit linux 安装 编辑:程序博客网 时间:2024/06/03 22:40
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:2Explanation: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).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; }
- 452. Minimum Number of Arrows to Burst Balloons Java解法
- Minimum Number of Arrows to Burst Balloons问题及解法
- Minimum Number of Arrows to Burst Balloons
- Minimum Number of Arrows to Burst Balloons
- Minimum Number of Arrows to Burst Balloons
- LeetCode 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【M】
- 452. Minimum Number of Arrows to Burst Balloons
- LeetCode 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[medium]
- 452. Minimum Number of Arrows to Burst Balloons
- [leetcode] 452. Minimum Number of Arrows to Burst Balloons
- Leetcode-452. Minimum Number of Arrows to Burst Balloons
- 【LeetCode】 452. Minimum Number of Arrows to Burst Balloons
- 452. Minimum Number of Arrows to Burst Balloons
- 常用插件--bootstrap3-dialog
- WPF不同线程之间的控件的访问
- 第10周作业1(LeetCode1)
- python3使用requests包抓取并保存网页源码
- Linux虚拟网络之tun(三)隔离网络下的Raw转发
- 452. Minimum Number of Arrows to Burst Balloons Java解法
- ImageLoader使用及源码解析
- RadioButton动态设置Margin
- java 如果文件目录不存在就创建再写文件的代码实例--针对“系统找不到指定的路径”问题。
- mybatis 在select语句中使用foreach语句报错
- 18 QT里的摄像头编程
- 矩阵最大值(解题报告)
- 文章标题
- Android:利用 LeakCanary 来检查 Android 内存泄漏