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

janeyziqinglin · web-flow · commit ae3fc9f57688 · 2023-05-03T21:02:58.000-04:00
题目已定义1 &lt;= nums.length.
diff --git 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]
