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

Merge pull request #1547 from firemaples/patch-1

Browse Source 
Update 0452.用最少数量的箭引爆气球.md
This commit is contained in:
程序员Carl
2022-08-10 10:06:04 +08:00
committed by GitHub
parent 1d816971a3 fdfddd88f9
commit 6513db2e3f
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

@ -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++) {
//如果下一个气球的左边界大于最小右边界 //如果下一个气球的左边界大于最小右边界
for(int i = 1; i < points.length; i++){ for(int i = 1; i < points.length; i++){
if (points[i][0] > leftmostRightBound ) { if (points[i][0] > leftmostRightBound ) {