StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018 2018-02-22 15:54:26 +08:00
parent 43fdefc0e8
commit 49f9bc1d76
1 changed files with 7 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
notes/Leetcode 题解.md
View File

@ -190,7 +190,7 @@ public int findContentChildren(int[] g, int[] s) {
} }
``` ```
**投飞镖刺气球** **投飞镖刺破气球**
[Leetcode : 452. Minimum Number of Arrows to Burst Balloons (Medium)](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/) [Leetcode : 452. Minimum Number of Arrows to Burst Balloons (Medium)](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/)
@ -202,7 +202,12 @@ Output:
2 2
``` ```
题目描述：气球在一个水平数轴上摆放，可以重叠，飞镖垂直射向坐标轴，使得路径上的气球都会刺破，求解最小的投飞镖次数。 题目描述：气球在一个水平数轴上摆放，可以重叠，飞镖垂直射向坐标轴，使得路径上的气球都会刺破。求解最小的投飞镖次数使所有气球都被刺破。
从左往右投飞镖，并且在每次投飞镖时满足以下条件：
1. 左边已经没有气球了；
2. 本次投飞镖能够刺破最多的气球。
```java ```java
public int findMinArrowShots(int[][] points) { public int findMinArrowShots(int[][] points) {