mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 12:15:58 +08:00
Update 0322.零钱兑换.md
This commit is contained in:
@ -261,7 +261,7 @@ class Solution:
|
||||
dp[0] = 0
|
||||
|
||||
for coin in coins:
|
||||
for i in range(coin, amount + 1):
|
||||
for i in range(coin, amount + 1): # 进行优化,从能装得下的背包开始计算,则不需要进行比较
|
||||
# 更新凑成金额 i 所需的最少硬币数量
|
||||
dp[i] = min(dp[i], dp[i - coin] + 1)
|
||||
|
||||
|
Reference in New Issue
Block a user