mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-06 23:28:29 +08:00
Merge pull request #1919 from juguagua/master
update 0416.分割等和子集:修改 python 代码中一维背包的错误
This commit is contained in:
@ -302,7 +302,7 @@ class Solution:
|
||||
target = sum(nums)
|
||||
if target % 2 == 1: return False
|
||||
target //= 2
|
||||
dp = [0] * (len(nums) + 1)
|
||||
dp = [0] * (target + 1)
|
||||
for i in range(len(nums)):
|
||||
for j in range(target, nums[i] - 1, -1):
|
||||
dp[j] = max(dp[j], dp[j - nums[i]] + nums[i])
|
||||
|
Reference in New Issue
Block a user