From cbdc4bd369541f15f504d71c4203a452a7e9ca65 Mon Sep 17 00:00:00 2001
From: ArthurP <gpan20020205@gmail.com>
Date: Sun, 29 Aug 2021 10:40:41 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=200452.=E7=94=A8=E6=9C=80?=
 =?UTF-8?q?=E5=B0=91=E6=95=B0=E9=87=8F=E7=9A=84=E7=AE=AD=E5=BC=95=E7=88=86?=
 =?UTF-8?q?=E6=B0=94=E7=90=83.md=20C=E8=AF=AD=E8=A8=80=E7=89=88=E6=9C=AC?=
 =?UTF-8?q?=E6=B3=A8=E9=87=8A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0452.用最少数量的箭引爆气球.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0452.用最少数量的箭引爆气球.md b/problems/0452.用最少数量的箭引爆气球.md
index a2168dfc..07141558 100644
--- a/problems/0452.用最少数量的箭引爆气球.md
+++ b/problems/0452.用最少数量的箭引爆气球.md
@@ -236,7 +236,7 @@ int findMinArrowShots(int** points, int pointsSize, int* pointsColSize){
         if(points[i][0] > points[i-1][1])
             arrowNum++;
         else
-            //若前一个气球与当前气球重叠，判断并最小的x_end
+            //若前一个气球与当前气球重叠，判断并更新最小的x_end
             points[i][1] = points[i][1] > points[i-1][1] ? points[i-1][1] : points[i][1];
     }
     return arrowNum;