Merge pull request #366 from z80160280/z80160280-patch-12

Update 0053.最大子序和（动态规划）.md

problems/0053.最大子序和（动态规划）.md

@@ -123,7 +123,19 @@ Java：
 ```
 
 Python：
-
+```python
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        if len(nums) == 0:
+            return 0
+        dp = [0] * len(nums)
+        dp[0] = nums[0]
+        result = dp[0]
+        for i in range(1, len(nums)):
+            dp[i] = max(dp[i-1] + nums[i], nums[i]) #状态转移公式
+            result = max(result, dp[i]) #result 保存dp[i]的最大值
+        return result
+```
 
 Go：