python 最小硬币数_动态规划，最小硬币数

If the amount does not match we have several options. What we want is the minimum of a penny plus the number of coins needed to make change for the original amount minus a penny, or a nickel plus the number of coins needed to make change for the original amount minus five cents, or a dime plus the number of coins needed to make change for the original amount minus ten cents, and so on. So the number of coins needed to make change for the original amount can be computed according to the following:numCoins=min(1+numCoins(originalamount−1),

1+numCoins(originalamount−5),

1+numCoins(originalamount−10),

1+numCoins(originalamount−25))

for循环中的下面一行正在计算numCoins的每个选项。在

^{pr2}$

循环中的下两行将跟踪numCoins的最小值：if numCoins < minCoins:

minCoins = numCoins

为了便于理解，可以将函数重写为：def recMC(coinValueList,change):

if change in coinValueList:

return 1

else:

return min([1 + recMC(coinValueList,change-c) for c in coinValueList if c < change])