小黑正在逐步走出雨夹雪天的影响，准备把论文整完去旅游的leetcode之旅：62. 不同路径-CSDN博客

本文链接：https://blog.csdn.net/qq_37418807/article/details/129111168

小黑代码：排列组合推导法

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        # C(m+n-2)^(m-1) or C(m+n-2)^(n-1)
        # 求组合数分母
        top_res = 1
        for i in range(n, m + n - 1):
            top_res *= i
        bottom_res = 1
        for i in range(1, m):
           bottom_res *= i
        return  top_res // bottom_res

在这里插入图片描述

小黑代码：记忆化搜索

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        map_ = {}
        def dfs(x = 0, y = 0):
            if (x, y) in map_:
                return map_[(x, y)]
            # 出界
            if x > m - 1 or y > n - 1:
                return 0
            # 到达终点
            if x == m - 1 and y == n - 1:
                return 1
            right = dfs(x, y + 1)
            bottom = dfs(x + 1, y)
            map_[(x, y)] = right + bottom
            return map_[(x, y)]
        return dfs()

在这里插入图片描述

动态规划

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        # 初始化动态规划数组
        dp = [[0] * n for _ in range(m)]
        for i in range(m):
            dp[i][0] = 1
        for j in range(n):
            dp[0][j] = 1
        # 开始进行动态规划推导
        for i in range(1, m):
            for j in range(1, n):
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[m-1][n-1]

在这里插入图片描述

数学法

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        top = m + n - 2
        bottom = m - 1
        top_ans = 1
        bottom_ans = 1
        for i in range(m-1):
            top_ans *= top
            bottom_ans *= bottom
            top -= 1
            bottom -= 1
        return int(top_ans // bottom_ans)