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

class Solution:
    def minMoney(self , arr: List[int], aim: int) -> int:
        # write code here
        dp=[aim for _ in range(aim+1)]
        n =len(arr)
        if aim==0:
            return 0
        dp[0]=0
        for i in range(1,aim+1):
            for j in range(n):
                if arr[j] <=i:
                    dp[i]=min(dp[i],dp[i-arr[j]]+1)
        print(dp)
        if dp[aim] <aim:
            return dp[aim]
        else:
            return -1