设有n 种不同面值的硬币，各硬币的面值存于数组T［1:n ］中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins［1:n ］中。对任意钱数0≤m≤20001，设计一个用最少硬币找钱m 的方法。-N has a different denomination coins, the coins stored in the array T [1: n ). Is to use these coins to change. Can use a variety of coins a number stored in the array Coins [1: n ). For any amount of money0< m < 20001, designed to use a least coin change m method.