题解 | #兑换零钱(一)#

简单的动态规划思想

class Solution:
    def minMoney(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)
        return dp[amount] if dp[amount]!=float("inf") else -1