题解 -动态规划 class Solution: def coinChange(self, coins: List[int], amount: int) -> int: dp=[float('inf')]*(amount+1) dp[0]=0 for coin in coins: for x in range(coin,amount+1): dp[x]=min(dp[x],dp[x-coin]+1) if dp[amount]==float('inf'): return -1 else: return dp[amount]