代码随想录45+46|| 70.爬楼梯 322.零钱兑换 279.完全平方数 139.单词拆分

70.爬楼梯

题目链接：https://leetcode.cn/problems/climbing-stairs/

代码还是不是按照完全背包写的， 但看了题解

class Solution:
    def climbStairs(self, n: int) -> int:
        dp = [0]*(n+1)

        dp[0] = 1
        dp[1] = 1

        for i in range(2,n+1):
            cur = dp[0] + dp[1]
            dp[0] = dp[1]
            dp[1] = cur
        return dp[1]

322.零钱兑换

题目链接：https://leetcode.cn/problems/coin-change/

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

279.完全平方数

题目链接：https://leetcode.cn/problems/perfect-squares/

受益于上一道题，只要能将题目理解成背包问题 就好做

class Solution:
    def numSquares(self, n: int) -> int:
        dp = [10**4] * (n+1)
        dp[0] = 0
        nums = [i**2 for i in range(1, n+1) if i**2 <= n]

        for num in nums:
            for i in range(num, n+1):
                dp[i] = min(dp[i], dp[i-num]+1)
        return dp[n]

139.单词拆分

题目链接：https://leetcode.cn/problems/word-break/

直接抄的题解，其实看了以后又觉得很简单 但自己真的想不到

class Solution:
    def wordBreak(self, s: str, wordDict: List[str]) -> bool:
        '''排列'''
        dp = [False]*(len(s) + 1)
        dp[0] = True
        # 遍历背包
        for j in range(1, len(s) + 1):
            # 遍历单词
            for word in wordDict:
                if j >= len(word):
                    dp[j] = dp[j] or (dp[j - len(word)] and word == s[j - len(word):j])
        return dp[len(s)]