322. 零钱兑换 Leetcode Java

题目：

给定不同面额的硬币 coins 和一个总金额 amount。编写一个函数来计算可以凑成总金额所需的最少的硬币个数。如果没有任何一种硬币组合能组成总金额，返回 -1。

示例 1:

输入: coins = [1, 2, 5], amount = 11
输出: 3 
解释: 11 = 5 + 5 + 1
示例 2:

输入: coins = [2], amount = 3
输出: -1
 

说明:
你可以认为每种硬币的数量是无限的。

暴力解决方式

class Solution {
    public int coinChange(int[] coins, int amount) {
        //如果钱总数
        if (amount == 0) return 0;
        if (amount < 0) return -1;
        int min = Integer.MAX_VALUE;
        int res =0;
        for (int coin : coins) {
            res = coinChange(coins, amount - coin);
            //来一次，min+1
            if (res >= 0 && res < min) {
                min = 1 + res;
            }
        }
        res = (min == Integer.MAX_VALUE) ? -1 : min;
        return res;
    }


}

带备忘录方式

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

    }
    private int coinChange(int[] coins, int rem, int[] count) {
        //base case
        if (rem == 0) return 0;
        if (rem < 0) return -1;
        if (count[rem - 1] != 0) return count[rem - 1];
        //求最小值，所以初始化为正无穷
        int min = Integer.MAX_VALUE;
        for (int coin : coins) {
            int res = coinChange(coins, rem - coin, count);
            if (res >= 0 && res < min)
                min = 1 + res;
        }
        count[rem - 1] = (min == Integer.MAX_VALUE) ? -1 : min;
        return count[rem - 1];
    }

}

动态规划

class Solution {
    public int coinChange(int[] coins, int amount) {
     
        int[] dp = new int[amount + 1];
        for (int i =0;i<dp.length;i++) {
            dp[i] = amount + 1;
            System.out.println("dp["+i+"]:" + dp[i]);
        }

        //base case
        dp[0] = 0;
        //遍历dp
        for (int i = 0; i < dp.length; i++) {
            for (int coin : coins) {

                //子问题无解，跳过
                if (i - coin < 0) continue;
                System.out.println("dp[i]:" + dp[i]);
                dp[i] = Math.min(dp[i], 1 + dp[i - coin]);
                System.out.println("dp[i - coin]:" + dp[i - coin]);

            }
        }
        dp[amount] = (dp[amount] == (amount + 1)) ? -1 : dp[amount];
        System.out.println("dp[amount]:" + dp[amount]);
        return dp[amount];
    }

}