Merge pull request #2074 from janeyziqinglin/master

53.最大子序和
2023-05-28 11:04:47 +08:00 · 2023-05-28 11:04:47 +08:00 · 60a2d4bfa7
parent 9168b90328 b794dccc5b
commit 60a2d4bfa7
1 changed files with 0 additions and 2 deletions
--- a/problems/0053.最大子序和（动态规划）.md
+++ b/problems/0053.最大子序和（动态规划）.md
@ -139,8 +139,6 @@ 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]