From 417d5b80bfb58654c13b70c08d83d2a22add3a61 Mon Sep 17 00:00:00 2001
From: ArthurP <gpan20020205@gmail.com>
Date: Sat, 28 Aug 2021 22:56:15 +0800
Subject: [PATCH 1/4] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200134.=E5=8A=A0?=
 =?UTF-8?q?=E6=B2=B9=E7=AB=99.md=20C=E8=AF=AD=E8=A8=80=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0134.加油站.md | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)

diff --git a/problems/0134.加油站.md b/problems/0134.加油站.md
index 0befd085..ff54fbc6 100644
--- a/problems/0134.加油站.md
+++ b/problems/0134.加油站.md
@@ -283,6 +283,30 @@ var canCompleteCircuit = function(gas, cost) {
 };
 ```
 
+C:
+```c
+int canCompleteCircuit(int* gas, int gasSize, int* cost, int costSize){
+    int curSum = 0;
+    int i;
+    int min = INT_MAX;
+    for(i = 0; i < gasSize; i++) {
+        int diff = gas[i] - cost[i];
+        curSum += diff;
+        if(min > curSum)
+            min = curSum;
+    }
+    if(curSum < 0)
+        return -1;
+    if(min >= 0)
+        return 0;
+    for(i = gasSize - 1; i >= 0; i--) {
+        min+=(gas[i]-cost[i]);
+        if(min >= 0)
+            return i;
+    }
+    return 0;
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)

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

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

diff --git a/problems/0452.用最少数量的箭引爆气球.md b/problems/0452.用最少数量的箭引爆气球.md
index 7b8130f0..a2168dfc 100644
--- a/problems/0452.用最少数量的箭引爆气球.md
+++ b/problems/0452.用最少数量的箭引爆气球.md
@@ -218,6 +218,30 @@ var findMinArrowShots = function(points) {
 };
 ```
 
+C:
+```c
+int cmp(const void *a,const void *b)
+{
+    return ((*((int**)a))[0] > (*((int**)b))[0]);
+} 
+
+int findMinArrowShots(int** points, int pointsSize, int* pointsColSize){
+    //将points数组作升序排序
+    qsort(points, pointsSize, sizeof(points[0]),cmp);
+    
+    int arrowNum = 1;
+    int i = 1;
+    for(i = 1; i < pointsSize; i++) {
+        //若前一个气球与当前气球不重叠，证明需要增加箭的数量
+        if(points[i][0] > points[i-1][1])
+            arrowNum++;
+        else
+            //若前一个气球与当前气球重叠，判断并最小的x_end
+            points[i][1] = points[i][1] > points[i-1][1] ? points[i-1][1] : points[i][1];
+    }
+    return arrowNum;
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)

From d327806115b66777e8e19ee27af10d4491b7a609 Mon Sep 17 00:00:00 2001
From: ArthurP <gpan20020205@gmail.com>
Date: Sun, 29 Aug 2021 10:37:39 +0800
Subject: [PATCH 3/4] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200134.=E5=8A=A0?=
 =?UTF-8?q?=E6=B2=B9=E7=AB=99.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/0134.加油站.md | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/problems/0134.加油站.md b/problems/0134.加油站.md
index ff54fbc6..ff3bc8b2 100644
--- a/problems/0134.加油站.md
+++ b/problems/0134.加油站.md
@@ -289,21 +289,26 @@ int canCompleteCircuit(int* gas, int gasSize, int* cost, int costSize){
     int curSum = 0;
     int i;
     int min = INT_MAX;
+    //遍历整个数组。计算出每站的用油差。并将其与最小累加量比较
     for(i = 0; i < gasSize; i++) {
         int diff = gas[i] - cost[i];
         curSum += diff;
-        if(min > curSum)
+        if(curSum < min)
             min = curSum;
     }
+    //若汽油总数为负数，代表无法跑完一环。返回-1
     if(curSum < 0)
         return -1;
+    //若min大于等于0，说明每一天加油量比用油量多。因此从0出发即可
     if(min >= 0)
         return 0;
+    //若累加最小值为负，则找到一个非零元素（加油量大于出油量）出发。返回坐标
     for(i = gasSize - 1; i >= 0; i--) {
         min+=(gas[i]-cost[i]);
         if(min >= 0)
             return i;
     }
+    //逻辑上不会返回这个0
     return 0;
 }
 ```

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 4/4] =?UTF-8?q?=E6=9B=B4=E6=96=B0=200452.=E7=94=A8?=
 =?UTF-8?q?=E6=9C=80=E5=B0=91=E6=95=B0=E9=87=8F=E7=9A=84=E7=AE=AD=E5=BC=95?=
 =?UTF-8?q?=E7=88=86=E6=B0=94=E7=90=83.md=20C=E8=AF=AD=E8=A8=80=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC=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;