From 54d0d9d1c1a579e0a8750f1be864ad78b8d13c45 Mon Sep 17 00:00:00 2001
From: Guanzhong Pan <gpan20020205@gmail.com>
Date: Tue, 12 Apr 2022 10:43:46 +0100
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200053.=E6=9C=80=E5=A4=A7?=
 =?UTF-8?q?=E5=AD=90=E6=95=B0=E7=BB=84=E5=92=8C.md=20C=E8=AF=AD=E8=A8=80?=
 =?UTF-8?q?=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0053.最大子序和.md | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)

diff --git a/problems/0053.最大子序和.md b/problems/0053.最大子序和.md
index 3d11c91e..9af02edf 100644
--- a/problems/0053.最大子序和.md
+++ b/problems/0053.最大子序和.md
@@ -230,6 +230,24 @@ var maxSubArray = function(nums) {
 };
 ```
 
+### C:
+```c
+int maxSubArray(int* nums, int numsSize){
+    int maxVal = INT_MIN;
+    int subArrSum = 0;
+    
+    int i;
+    for(i = 0; i < numsSize; ++i) {
+        subArrSum += nums[i];
+        // 若当前局部和大于之前的最大结果，对结果进行更新
+        maxVal = subArrSum > maxVal ? subArrSum : maxVal;
+        // 若当前局部和为负，对结果无益。则从nums[i+1]开始应重新计算。
+        subArrSum = subArrSum < 0 ? 0 : subArrSum;
+    }
+
+    return maxVal;
+}
+```
 
 
 -----------------------