Update 0518.零钱兑换II.md 补充二维dp数组的Java代码 #1983
Merged
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
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.
在学到动态规划完全背包这部分时候，零钱兑换II 这道题直接就开始从一维数组开始讲，对我来说跨度有点大了。
我一直没有理解，直到我看了其他人写的状态转移方程：
f[i][j] = max(f[i-1][j-kw[i]] + kv[i]) (0 <= k*w[i] <= j)，然后摸索出了这个二维数组版本的代码，个人感觉对于理解完全背包更直观一点。代码可以AC，只是耗时垫底(doge