题目:
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1
.
Example 1:
coins = [1, 2, 5]
, amount = 11
return 3
(11 = 5 + 5 + 1)
Example 2:
coins = [2]
, amount = 3
return -1
.
Note:
You may assume that you have an infinite number of each kind of coin.
题意:
给定一些不同面值的硬币值和一个钱数,写一个功能计算最少能用几个硬币来找零,如果任何组合都不能凑到给定的钱数,则返回-1.
思路一:
使用动态规划Dynamic Programming完成,维护一个一维动态数组dp,其中dp[i]表示钱数为i时的最小硬币数的找零,则递推公式为:
dp[i] = min(dp[i], dp[i - coins[j]] + 1);
其中coins[j]为给定的第j个硬币值,而i-coins[j]表示钱数i减去其中一个硬币的值,剩余的钱数在dp数组找到值,然后加1和当前dp数组中的值作比较,取较小的那个值更新dp数组。
代码:C++版:156ms
class Solution { public: int coinChange(vector<int>& coins, int amount) { vector<int> dp(amount + 1, amount + 1); dp[0] = 0; for (int i=1; i<=amount; ++i) { for (int j=0; j<coins.size(); ++j) { if (coins[j] <= i) { dp[i] = min(dp[i], dp[i - coins[j]] + 1); } } } return dp[amount] > amount ? -1 : dp[amount]; } };
思路二:
递归实现,主要思路同上。
代码:C++版:180ms
class Solution { public: int coinChange(vector<int>& coins, int amount) { vector<int> dp(amount + 1, INT_MAX); dp[0] = 0; return coinChangeDFS(coins, amount, dp); } int coinChangeDFS(vector<int> &coins, int amount, vector<int> &dp) { if (amount < 0) return - 1; if (dp[amount] != INT_MAX) return dp[amount]; for (int i = 0; i < coins.size(); ++i) { int tmp = coinChangeDFS(coins, amount - coins[i], dp); if (tmp >= 0) dp[amount] = min(dp[amount], tmp + 1); } return dp[amount] = dp[amount] == INT_MAX ? -1 : dp[amount]; } };