algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1553 from wangtaocs/master

Browse Source 
0452.用最少数量的箭引爆气球 Java代码修改
This commit is contained in:
程序员Carl
2022-07-30 10:25:00 +08:00
committed by GitHub
parent 9023954993 37fe7afe4c
commit f6e8a8f681
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -151,6 +151,7 @@ class Solution {
//重叠气球的最小右边界 //重叠气球的最小右边界
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 ) {
//增加一次射击 //增加一次射击
count++; count++;