动态规划：力扣322. 零钱兑换（完全背包）

1、题目描述：

2、题解：
带备忘的递归：

class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:

        # 备忘录
        memo = dict()

        def dp(n):
            # 查备忘录，避免重复计算
            if n in memo: return memo[n]

            if n == 0: return 0
            if n < 0: return -1
            res = float('INF')
            for coin in coins:
                subproblem = dp(n - coin)
                if subproblem == -1: continue
                res = min(res, 1 + subproblem)

            # 记入备忘录
            memo[n] = res if res != float('INF') else -1
            return memo[n]

        return dp(amount)

动态规划：
状态定义：
dp[i] ：凑齐总价值 i 需要的最少硬币数，状态就是问的问题。
状态转移方程为：
dp[i] = min(dp[i],1 + dp[i - coin])
初始化：
dp[0] = 0,当总金额为0时，凑成0需要0个硬币
Python代码：

class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        #动态规划，完全背包
        dp = [amount + 1] * (amount + 1) 
        dp[0] = 0
        for i in range(amount + 1) :
            for coin in coins:
                if i - coin < 0:continue
                dp[i] = min(dp[i],1 + dp[i - coin])
        if dp[amount] == amount + 1:
            return -1
        else:
            return dp[amount]

C++代码如下：

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        //动态规划
        vector<int> dp(amount + 1,amount + 1);
        dp[0] = 0;
        for (auto coin : coins)
            for (int i = coin;i <= amount;i++)
                dp[i] = min(dp[i],dp[i - coin] + 1);
        return dp[amount] == amount + 1 ? -1 : dp[amount];
    }
};