修改 0494.目标和 中Python二维DP版本状态转移判断 #2927
Open
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
判断条件使用了nums[i-1]而不是当前处理的元素nums[i]。这导致在处理第i个元素时错误地检查了前一个元素的值，从而导致状态转移错误。 正确的条件应为j >= nums[i]，以确保当前元素nums[i]可以被选中。 同时建议可以去除初始化时对0元素的操作，在双重循环中当我们碰到0的时候，dp[i][j]会被加2次，这就与2^(0的个数)相对应了。
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
判断条件使用了nums[i-1]而不是当前处理的元素nums[i]。这导致在处理第i个元素时错误地检查了前一个元素的值，从而导致状态转移错误。
正确的条件应为j >= nums[i]，以确保当前元素nums[i]可以被选中。
同时建议可以去除初始化时对0元素的操作，在双重循环中当我们碰到0的时候，dp[i][j]会被加2次，这就与2^(0的个数)相对应了。