题目描述
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.
解题思路
典型的动态规划思路,相当于可重复背包。
定义数组dp[i]:表示当钱数总额为i时,需要最少的钱币数为dp[i]个。
初始条件:dp[0]=0,表示用0个硬币可凑到0元。其余dp[i]=max_value(任意一个很大的值或者amount+1均可)
状态转移方程:dp[i]=min(dp[i], dp[i-coins[j]]+1) ,j从1循环到coins的长度减一。
dp[i-coins[j]]+1的含义为,从coins[j]中选择一种面值大小的硬币,用总额减去这一种面值,现在的总额为amount-coins[j],如果dp[amount-coins[j]]存在,则用这个数量再加上1(coins[j]的一枚),就是新的最小硬币数。否则,不存在的话,就是初始化为最大值时的数额数。
复杂度分析
两层遍历,时间复杂度为O(N*N)。
代码如下:
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
if (amount<0) {
return -1;
}
vector<int>dp(amount+1);//达到数值为i的总和需要个数dp[i]个硬币
dp[0]=0;
for (int i=1; i<amount+1; i++) {
dp[i]=1000000000;//初始赋值为最大值,或amount+1
}
for (int i=1; i<=amount; i++) {
for (int j=0; j<coins.size(); j++) {
if (i>=coins[j]) {
dp[i]=min(dp[i],dp[i-coins[j]]+1);
}
}
}
if (dp[amount]==1000000000) {
return -1;
}
else
return dp[amount];
}
};