LeetCode动态规划70|322|279

最新推荐文章于 2024-06-06 11:58:07 发布

Erin Wang

最新推荐文章于 2024-06-06 11:58:07 发布

阅读量182

点赞数 2

分类专栏： LeetCode 文章标签： leetcode 动态规划算法

本文链接：https://blog.csdn.net/ErinWang666/article/details/137126946

版权

LeetCode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

70爬楼梯

class Solution:
    def climbStairs(self, n: int) -> int:
        if n == 1:
            return n
        dp = [0] * (n + 1)
        dp[1] = 1
        dp[2] = 2
        for i in range(3, len(dp)):
            dp[i] = dp[i - 2] + dp[i - 1]
        return dp[n]

322零钱兑换

class Solution:
    def coinChange(self, coins: List[int], amount: int) -> int:
        dp = [float('inf')] * (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)
        if dp[amount] == float('inf'):
            return -1
        else:
            return dp[amount]

279完全平方数

class Solution:
    def numSquares(self, n: int) -> int:
        dp = [float('inf')] * (n + 1)
        dp[0] = 0
        for j in range(n + 1):
            for i in range(1, int(j ** 0.5) + 1):
                dp[j] = min(dp[j], dp[j - i * i] + 1)
        return dp[n]