algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
题目已定义1 <= nums.length.
This commit is contained in:
JaneyLin
2023-05-03 21:02:58 -04:00
committed by GitHub
parent d6b1f3e953
commit ae3fc9f576
1 changed files with 0 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -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]