DP-LeetCode322.零钱兑换coinChange（Python）

1、题目描述

https://leetcode-cn.com/problems/coin-change/

2、代码详解

python版

class Solution(object):
    def coinChange(self, coins, amount):
        # 不同面额的硬币 coins 和一个总金额 amount
        MAX = float('inf')
        dp = [MAX for i in range(amount+1)]
        dp[0] = 0
        for i in range(1, amount+1):
            for coin in coins:  # 依次取不同的币值
                # 写法1
                # if i - coin < 0:
                #     continue  # 跳出取coin的循环
                # dp[i] = min(dp[i], dp[i-coin]+1)
                # 写法2
                if i >= coin and dp[i-coin] != MAX:
                    dp[i] = min(dp[i], dp[i-coin]+1)

        if dp[amount] == MAX:  # max时表示无法用硬币拼出amount
            return -1
        return dp[amount]

amount = 11
coins = [1, 2, 5]
s = Solution()
print(s.coinChange(coins, amount))

https://www.jiuzhang.com/solution/coin-change/#tag-highlight-lang-python

java版

public class coinChange322 {
    public static void main(String[] args){
        int[] coins = {1, 2, 5};
        int amount = 11;
        System.out.println(coinChange(coins, amount));

    }

    public static int coinChange(int[] coins, int amount){
        // 数组大小为 amount + 1，初始值也为 amount + 1
        int max = amount + 1;
        int[] dp = new int[amount+1];
        // base case
        Arrays.fill(dp, max);
        dp[0] = 0;
        for (int i = 0; i <= amount; i++) {//0,<不行，注意边界条件
            // 内层 for 在求所有子问题 + 1 的最小值
            for (int coin : coins) {
                // 子问题无解，跳过
                if (i - coin < 0) continue;
                dp[i] = Math.min(dp[i], 1 + dp[i - coin]);
            }
//            for (int j = 0; j < coins.length; j++) {
//                if (coins[j] <= i) {
//                    dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1);
//                }
        }
        return (dp[amount] > amount) ? -1 : dp[amount];
    }
}

labuladong的动态规划

DP法和DFS+greedy+pruning法

https://www.bilibili.com/video/av31621107?from=search&seid=2529841167284044495