动态规划-322-零钱换整钱

Description:

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

---

问题分析

动态规划
典型的背包问题

DFS
注意对硬币先排序

---

解法1(DFS):

public class Solution {
    int min = Integer.MAX_VALUE;

    public int coinChange(int[] coins, int amount) {
        if(amount == 0) return 0;

        Arrays.sort(coins);
        coinChange(coins, amount, coins.length - 1, 0);

        if(min == Integer.MAX_VALUE)    return -1;
        return min;
    }

    public void coinChange(int[] coins, int amount, int index, int num){
        if(amount % coins[index] == 0){
            int newCount = num + amount / coins[index];
            if(newCount < min)  min = newCount;
        }

        if(index == 0)  return;

        int possible = amount / coins[index];
        for(int i = possible; i >= 0; i--){
            int newAmount = amount - coins[index] * i;
            int newNum = num + i;

            int nextCoin = coins[index - 1];
            if(newNum + (newAmount + nextCoin - 1) / nextCoin >= min)   break;

            coinChange(coins, newAmount, index - 1, newNum);

        }
    }
}

解法2(动态规划)

public class Solution {
    public int coinChange(int[] coins, int amount) {
        int max = amount + 1;
        int[] dp = new int[amount + 1];
        Arrays.fill(dp,max);
        dp[0] = 0;

        for(int i = 1;i <= amount;i++){
            for(int j = 0;j < coins.length;j++){
                if(i >= coins[j])   dp[i] = Math.min(dp[i - coins[j]] + 1, dp[i]);
            }
        }

        return dp[amount] == max ? -1 : dp[amount];
    }
}