leetcode-322 零钱兑换 Python

最新推荐文章于 2024-01-25 21:58:43 发布

Xenonon

最新推荐文章于 2024-01-25 21:58:43 发布

阅读量202

点赞数

文章标签： python leetcode

本文链接：https://blog.csdn.net/Xenonon/article/details/104742835

版权

方法一：动态规划（自下而上）

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)
        return dp[amount] if dp[amount] != float('inf') else -1

方法二：动态规划（自上而下）

import functools
class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        @functools.lru_cache(amount)
        def dp(rem):
            if rem < 0: return -1
            if rem == 0: return 0
            mini = int(1e9)
            for coin in self.coins:
                res = dp(rem - coin)
                if res >= 0 and res < mini:
                    mini = res + 1
            return mini if mini < int(1e9) else -1
        self.coins = coins
        if amount < 1: return 0
        return dp(amount)