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.
题意:给出硬币的面值和总额,求最少用多少块硬币凑齐总额,如果不能筹齐返回-1。
思路:如例1,从1到11分别求出每个总额需要的最少硬币数。
当总额为1,最少硬币数为1;
当总额为2,最少硬币数为1;
当总额为3,最少硬币数为2;
当总额为4,最少硬币数为2;
当总额为5,最少硬币数为1;
当总额为6,最少硬币数为2;
当总额为7,最少硬币数为2;
当总额为8,最少硬币数为3;
当总额为9,最少硬币数为3;
当总额为10,最少硬币数为2;
当总额为11,先看总额为6需要的硬币数:2,总额为9的硬币数:3,总额为10的硬币数:2,
所以总额为11需要最小的硬币数为3:总额为6的硬币数+1或者总额为10的硬币数+1;
代码:
class Solution {
public int coinChange(int[] coins, int amount) {
int maxAmount = amount+1;
int[] dp = new int[amount+1];
for(int i=1;i<=amount;i++){
dp[i]=maxAmount;
for(int coin: coins){
if(coin <= i && dp[i-coin]!= -1){
dp[i]=Math.min(dp[i],dp[i-coin]+1);
}
}
}
return dp[amount] == maxAmount ? -1 : dp[amount];
}
}