Update 053.最大子序和.py

linwt · web-flow · commit 26c6e14de579 · 2019-06-06T10:54:13.000+08:00
diff --git a/leetcode/053.最大子序和.py b/leetcode/053.最大子序和.py
@@ -11,11 +11,12 @@ def maxSubArray(self, nums):
                 sum = 0
         return max_sum
 
-# 方法二：动态规划，用数组保存当前最大值
+# 方法二：动态规划，dp[i]表示以下标i元素结尾的数组最大和
 class Solution(object):
     def maxSubArray(self, nums):
         n = len(nums)
-        max_sum = [nums[0] for _ in range(n)]
+        dp = [nums[0] for _ in range(n)]
         for i in range(1, n):
-            max_sum[i] = max(max_sum[i-1] + nums[i], nums[i])
-        return max(max_sum)
+            # 前一状态最大和加上当前元素值，与当前元素值比较出较大者
+            dp[i] = max(dp[i-1] + nums[i], nums[i])
+        return max(dp)
