0452.用最少数量的箭引爆气球 Java代码修改

2025-07-10 04:06:51 +08:00 · 2022-07-30 09:45:38 +08:00
parent b2df4ad5e5
commit 056f816448
1 changed files with 1 additions and 0 deletions
--- a/problems/0452.用最少数量的箭引爆气球.md
+++ b/problems/0452.用最少数量的箭引爆气球.md
@ -151,6 +151,7 @@ class Solution {
        //重叠气球的最小右边界
        int leftmostRightBound  = points[0][1];
        //如果下一个气球的左边界大于最小右边界
+        for(int i = 1; i < points.length; i++){
            if (points[i][0] > leftmostRightBound ) {
                //增加一次射击
                count++;