CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' of github.com:youngyangyang04/leetcode-master

Browse Source
This commit is contained in:
programmercarl
2023-06-06 23:38:39 +08:00
parent 4eadc742c7 73e8eb9386
commit 46a81f2073
85 changed files with 4053 additions and 2229 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -144,8 +144,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]