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

Merge pull request #2074 from janeyziqinglin/master

Browse Source 
53.最大子序和
This commit is contained in:
程序员Carl
2023-05-28 11:04:47 +08:00
committed by GitHub
parent 9168b90328 b794dccc5b
commit 60a2d4bfa7
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 ```python
class Solution: class Solution:
def maxSubArray(self, nums: List[int]) -> int: def maxSubArray(self, nums: List[int]) -> int:
if len(nums) == 0:
return 0
dp = [0] * len(nums) dp = [0] * len(nums)
dp[0] = nums[0] dp[0] = nums[0]
result = dp[0] result = dp[0]