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:
Input: coins =[1, 2, 5]
, amount =11
Output:3
Explanation: 11 = 5 + 5 + 1
Example 2:
Input: coins =[2]
, amount =3
Output: -1
Note:
You may assume that you have an infinite number of each kind of coin.
暴力解法
class Solution {
public int coinChange(int[] coins, int amount) {
return minCoins(coins,0,amount);
}
public int minCoins(int[] coins,int index,int amount){
if(amount==0){
return 0;
}
int minCount = Integer.MAX_VALUE;
if(index<coins.length&&amount>0){
for(int i=0;i*coins[index]<=amount;i++){
int ret = minCoins(coins,index+1,amount-i*coins[index]);
if(ret!=-1){
minCount = Math.min(minCount,ret+i);
}
}
}
return minCount==Integer.MAX_VALUE?-1:minCount;
}
}
动态规划
class Solution {
public int coinChange(int[] coins, int amount) {
int len = coins.length;
int[][] dp = new int[len][amount+1];
for(int[] temp:dp){
Arrays.fill(temp,Integer.MAX_VALUE);
}
for(int i=0;i<len;i++){
dp[i][0] = 0;
}
for(int i=0;i*coins[0]<=amount;i++){
dp[0][i*coins[0]] = i;
}
for(int i=1;i<len;i++){
for(int j=1;j<=amount;j++){
for(int k=0;k*coins[i]<=j;k++){
if(dp[i-1][j-k*coins[i]]==Integer.MAX_VALUE)
continue;
dp[i][j] = Math.min(dp[i][j],dp[i-1][j-k*coins[i]]+k);
}
}
}
return dp[len-1][amount]==Integer.MAX_VALUE?-1:dp[len-1][amount];
}
}