#322 Coin Change

Description

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

Return 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.

You may assume that you have an infinite number of each kind of coin.

Examples

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

Example 3:

Input: coins = [1], amount = 0
Output: 0

Constraints:

1 <= coins.length <= 12
1 <= coins[i] <= $2^{31}-1$
0 <= amount <= $10^4$

思路

• 就是多重背包，下面给出两种dp数组构建

代码

2D DP

class Solution {
    public int coinChange(int[] coins, int amount) {
        int[][] dp = new int[coins.length][amount + 1];
        
        for (int j = 0; j < amount + 1; j++)
            dp[0][j] = j % coins[0] == 0? j / coins[0]: -1;
        for (int i = 0; i < coins.length; i++)
            dp[i][0] = 0;
        
        for (int i = 1; i < coins.length; i++){
            for (int j = 1; j < amount + 1; j++){
                dp[i][j] = dp[i - 1][j];
                if (j - coins[i] >= 0){
                    if (dp[i][j] != -1 && dp[i][j - coins[i]] != -1)
                        dp[i][j] = Math.min(dp[i][j], dp[i][j - coins[i]] + 1);
                    else if (dp[i][j - coins[i]] != -1)
                        dp[i][j] = dp[i][j - coins[i]] + 1;
                }
            }
        }
        
        return dp[coins.length - 1][amount];
    }
}

1D DP

class Solution {
    public int coinChange(int[] coins, int amount) {
        int[] dp = new int[amount + 1];
        
        for (int j = 0; j < amount + 1; j++)
            dp[j] = j % coins[0] == 0? j / coins[0]: amount + 1;
        
        for (int i = 1; i < amount + 1; i++){
            for (int j = 1; j < coins.length; j++){
                if (i - coins[j] >= 0)
                    dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1);
            }
        }
        
        return dp[amount] > amount ? -1: dp[amount];
    }
}