[算法导论] 零钱兑换 II

目录

 0. 题目

1. 动态规划 

代码

---

 0. 题目

1. 动态规划 

代码

class Solution:
    def change(self, amount: int, coins: List[int]) -> int:
        dp = [0]*(amount+1)
        dp[0] = 1
        for coin in coins:
            for i in range(coin,amount+1):
                dp[i] += dp[i-coin]
        return dp[amount]