打卡题目:leetcode第322题,零钱兑换

【代码】
class Solution:def coinChange(self, coins: List[int], amount: int) -> int:dp = [amount + 1] * (amount + 1)dp[0] = 0# 对于每个coin,dp[i] = min(dp[i], dp[i-coin]+1)for i in range(1, amount + 1):for coin in coins:if i >= coin:dp[i] = min(dp[i], dp[i-coin]+1)return dp[-1] if dp[-1] != amount+1 else -1
