力扣 322. 零钱兑换

def coinChange(coins, amount):
    # 无限背包最大变最小问题
    dp = [float("inf") for _ in range(amount + 1)]
    dp[0] = 0
    for i in range(len(coins)):
        for j in range(coins[i], amount + 1):
            dp[j] = min(dp[j], dp[j - coins[i]] + 1)
    return dp[amount] if dp[amount] != float("inf") else -1