Commit 0afc3f7

committed

修复0494.目标和题目Python二维DP解法中的错误

在遍历过程中,只有j >= 本次遍历元素才可以选取当前元素,原代码中错写为j>=nums[i-1],修复后变为j>=nums[i],提交才可以通过leetcode所有用例。

1 parent 7aa973b commit 0afc3f7Copy full SHA for 0afc3f7

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -684,7 +684,7 @@ class Solution:`
`684`	`684`	`for i in range(1, len(nums)):`
`685`	`685`	`for j in range(target_sum + 1):`
`686`	`686`	`dp[i][j] = dp[i - 1][j] # 不选取当前元素`
`687`		`- if j >= nums[i-1]:`
	`687`	`+ if j >= nums[i]: #只有j >= 本次遍历元素才可以选取当前元素`
`688`	`688`	`dp[i][j] += dp[i - 1][j - nums[i]] # 选取当前元素`
`689`	`689`
`690`	`690`	`return dp[len(nums)-1][target_sum] # 返回达到目标和的方案数`

Comments

(0)