From 848fbd4cd5c868839c75c637ef5ea9057ab301d7 Mon Sep 17 00:00:00 2001
From: Zhihan Li <54661071+zhihali@users.noreply.github.com>
Date: Sun, 22 Sep 2024 16:22:04 +0100
Subject: [PATCH] =?UTF-8?q?Update=200053.=E6=9C=80=E5=A4=A7=E5=AD=90?=
 =?UTF-8?q?=E5=BA=8F=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0053.最大子序和.md b/problems/0053.最大子序和.md
index 551c39bf..1c7ff0cd 100644
--- a/problems/0053.最大子序和.md
+++ b/problems/0053.最大子序和.md
@@ -214,6 +214,7 @@ class Solution:
         return result
 
 ```
+贪心法
 ```python
 class Solution:
     def maxSubArray(self, nums):
@@ -226,8 +227,18 @@ class Solution:
             if count <= 0:  # 相当于重置最大子序起始位置，因为遇到负数一定是拉低总和
                 count = 0
         return result
-
-
+```
+动态规划
+```python
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        dp = [0] * len(nums)
+        dp[0] = nums[0]
+        res = nums[0]
+        for i in range(1, len(nums)):
+            dp[i] = max(dp[i-1] + nums[i], nums[i])
+            res = max(res, dp[i])
+        return res
 ```
 ### Go
 贪心法