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;
+}
+```
 
 
 -----------------------