learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Update 0452.用最少数量的箭引爆气球.md 

Add a missing line back
This commit is contained in:
firemaples 2022-07-26 22:37:40 +08:00 committed by GitHub
parent 95e9296301
commit fdfddd88f9
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
problems/0452.用最少数量的箭引爆气球.md
View File

@ -150,6 +150,7 @@ class Solution {
int count = 1; int count = 1;
//重叠气球的最小右边界 //重叠气球的最小右边界
int leftmostRightBound = points[0][1]; int leftmostRightBound = points[0][1];
for (int i = 1; i < points.length; i++) {
//如果下一个气球的左边界大于最小右边界 //如果下一个气球的左边界大于最小右边界
if (points[i][0] > leftmostRightBound ) { if (points[i][0] > leftmostRightBound ) {
//增加一次射击 //增加一次射击