diff --git a/problems/0452.用最少数量的箭引爆气球.md b/problems/0452.用最少数量的箭引爆气球.md
index 3042b063..7b5f387d 100644
--- 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++;