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

Add a missing line back
2022-07-26 22:37:40 +08:00 · 2022-07-26 22:37:40 +08:00 · fdfddd88f9
parent 95e9296301
commit fdfddd88f9
1 changed files with 1 additions and 0 deletions
--- a/problems/0452.用最少数量的箭引爆气球.md
+++ b/problems/0452.用最少数量的箭引爆气球.md
@ -150,6 +150,7 @@ class Solution {
        int count = 1;
        //重叠气球的最小右边界
        int leftmostRightBound  = points[0][1];
+        for (int i = 1; i < points.length; i++) {
        //如果下一个气球的左边界大于最小右边界
            if (points[i][0] > leftmostRightBound ) {
                //增加一次射击