dp 找零兑换代码

_CL0v3r

于 2021-03-24 11:16:48 发布

阅读量76

点赞数

本文链接：https://blog.csdn.net/Norikage/article/details/115167653

版权

此篇博客介绍了如何使用动态规划解决dpMakeChange函数，通过coinValueList计算给定金额amnt所需的最少硬币组合，并展示了printCoins函数打印找零硬币的过程。讨论了如何利用给定的货币清单[1,5,10,21,25]来实现找零算法并输出详细的步骤。

摘要由CSDN通过智能技术生成

def dpMakeChange(coinValueList, change, minCoins, coinsUsed):
    for cents in range(1, change + 1):
        # 初始化一个最大值
        coinCount = cents
        # 初始化一下新加的那个硬币
        newCoin = 1
        for j in [c for c in coinValueList if c <= cents]:
            if minCoins[cents - j] + 1 < coinCount:
                coinCount = minCoins[cents - j] + 1
                newCoin = j # 对应最小数量，所减的硬币
        minCoins[cents] = coinCount
        coinsUsed[cents] = newCoin
    return minCoins[change]

def printCoins(coinsUsed, change):
    coin = change
    while coin > 0:
        thisCoin = coinsUsed[coin]
        print(thisCoin)
        coin -= thisCoin

amnt = 63
clist = [1, 5, 10, 21, 25]
coinsUsed = [0] * (amnt + 1)
coinCount = [0] * (amnt + 1)

print("Making change for", amnt, "requires", end = ' ')
print(dpMakeChange(clist, amnt, coinCount, coinsUsed), "coins")
print("They are:")
printCoins(coinsUsed, amnt)
print("The used list is as follow:")
print(coinsUsed)