Location:
Search - zuishaoyingbi
Search list
Description: 设有n种不同面值的硬币，各硬币的面值存于数组T[1:n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[1:n]中。
对任意钱数0<=m<=20001,设计一个用最少硬币找钱m的方法。
-N has a different face value coins, the face value of the coins stored in the array T [1: n] in. Is to use these coins to find the money. Can use the various denominations of the coins stored in an array of the number of Coins [1: n] in. The amount of money for any 0 < = m < = 20001, the design of a coin with at least the method of m money.
Platform: |
Size: 45056 |
Author: 无疆 |
Hits:
Description: 最少硬币问题的解决办法，递归方法，动态规划，弹性算法-the lease number of coins
Platform: |
Size: 31744 |
Author: 刘明霞 |
Hits: