Commit 285b6ab

authored

Update 0416.分割等和子集.md

1 parent cb9da4f commit 285b6abCopy full SHA for 285b6ab

File tree

-6

lines changed

-6

lines changed

Lines changed: 2 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -349,10 +349,7 @@ class Solution:`
`349`	`349`	`dp[i][j] = dp[i - 1][j]`
`350`	`350`	`else:`
`351`	`351`	`# 当前数字小于等于目标和时,可以选择使用或不使用该数字`
`352`		`- # dp[i][j] = dp[i - 1][j] or dp[i - 1][j - nums[i - 1]]`
`353`		`-`
`354`		`- # 当前数字小于等于目标和时,选择使用或不使用该数字的最大值`
`355`		`- dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - nums[i - 1]])`
	`352`	`+ dp[i][j] = dp[i - 1][j] or dp[i - 1][j - nums[i - 1]]`
`356`	`353`
`357`	`354`	`return dp[len(nums)][target_sum]`
`358`	`355`
`@@ -374,8 +371,7 @@ class Solution:`
`374`	`371`	`for num in nums:`
`375`	`372`	`# 从target_sum逆序迭代到num,步长为-1`
`376`	`373`	`for i in range(target_sum, num - 1, -1):`
`377`		`- dp[i] = max(dp[i], dp[i - num]) # 可以将其改成 dp[i] = dp[i] or dp[i - num]`
`378`		`-`
	`374`	`+ dp[i] = dp[i] or dp[i - num]`
`379`	`375`	`return dp[target_sum]`
`380`	`376`
`381`	`377`

Comments

(0)