diff --git a/problems/0452.用最少数量的箭引爆气球.md b/problems/0452.用最少数量的箭引爆气球.md
index 7b5f387d..c571a235 100644
--- 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++) {
         //如果下一个气球的左边界大于最小右边界
         for(int i = 1; i < points.length; i++){
             if (points[i][0] > leftmostRightBound ) {