刷题记录：322. 零钱兑换12

JonassssRo

已于 2022-03-04 15:49:55 修改

阅读量383

点赞数

分类专栏：算法笔记数据结构 python 文章标签：动态规划 leetcode 算法

于 2022-01-30 12:15:12 首次发布

本文链接：https://blog.youkuaiyun.com/Peloponnesian/article/details/122751727

版权

数据结构同时被 3 个专栏收录

45 篇文章

订阅专栏

算法笔记

42 篇文章

订阅专栏

python

21 篇文章

订阅专栏

322. 零钱兑换
很常规的动规

class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        dp = [float('inf') for _ in range(amount + 1)]
        dp[0] = 0
        # print(dp)
        for i in range(1,amount+1):
            for coin in coins:
                if i - coin >= 0:
                    dp[i] = min(dp[i], dp[i - coin] + 1)
                else:
                    continue
        # print(dp)
        return dp[-1] if dp[-1] != float('inf') else -1

518. 零钱兑换 II

class Solution:
    def change(self, amount: int, coins: List[int]) -> int:
        dp = [0] * (amount + 1)
        dp[0] = 1
        for coin in coins:
            for i in range(1,amount + 1):
                if i < coin:
                    continue
                else:
                    dp[i] += dp[i-coin]
        return dp[-1]