algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 20:40:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0322.零钱兑换.md

Browse Source
This commit is contained in:
jianghongcheng
2023-06-04 23:32:42 -05:00
committed by GitHub
parent beb0a51841
commit 0964e16991
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0322.零钱兑换.md
View File

@ -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)