leetcode 62\70\78

最新推荐文章于 2024-10-17 19:06:39 发布

Riccca

最新推荐文章于 2024-10-17 19:06:39 发布

阅读量104

点赞数

分类专栏： python leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/Riccca/article/details/112799682

版权

leetcode 同时被 2 个专栏收录

17 篇文章 0 订阅

订阅专栏

python

16 篇文章 0 订阅

订阅专栏

62 不同路径

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        dp = [[0]*n for i in range(m)]
        # print(dp)
        for j in range(n):
            dp[0][j] = 1
        
        for i in range(1,m):
            dp[i][0] = 1
            for j in range(1,n):
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        # print(dp)
        return dp[-1][-1]

70 爬楼梯

# 定义dp数组为dp[n], 有n级楼梯的方法有dp[n]种
# dp[n] = dp[n-1] + dp[n-2]

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):
            dp[i] = dp[i-1] + dp[i-2]
        # print(dp)
        return dp[-1]

78 子集

# 回溯算法
class Solution:
    def subsets(self, nums: List[int]) -> List[List[int]]:
        n = len(nums)
        res = []
        def backtrack(nums, start, track):
            # print(start)
            # print(track)
            res.append(track[:])
            for i in range(start, n):
                track.append(nums[i])
                backtrack(nums, i+1, track)
                track.pop()
        backtrack(nums, 0, [])
        return res