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

python一维数组初始化长度应为target+1

Browse Source
This commit is contained in:
ruyubai1
2023-03-05 18:52:47 +01:00
committed by GitHub
parent 408c8f3ae9
commit 1d44a17aaa
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0416.分割等和子集.md
View File

@ -302,7 +302,7 @@ class Solution:
target = sum(nums) target = sum(nums)
if target % 2 == 1: return False if target % 2 == 1: return False
target //= 2 target //= 2
dp = [0] * (len(nums) + 1) dp = [0] * (target + 1)
for i in range(len(nums)): for i in range(len(nums)):
for j in range(target, nums[i] - 1, -1): for j in range(target, nums[i] - 1, -1):
dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]) dp[j] = max(dp[j], dp[j - nums[i]] + nums[i])