Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 776a9e0

Browse files
update content
1 parent 0227885 commit 776a9e0

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎动态规划系列/动态规划详解进阶.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -276,7 +276,7 @@ int coinChange(int[] coins, int amount) {
276276
int dp(int[] coins, int n) {
277277
// 做选择,选择需要硬币最少的那个结果
278278
for (int coin : coins) {
279-
res = min(res, 1 + dp(n - coin))
279+
res = min(res, 1 + dp(coins, n - coin))
280280
}
281281
return res
282282
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /