62. 不同路径

最新推荐文章于 2025-07-17 20:42:13 发布

ranzhiyimu

最新推荐文章于 2025-07-17 20:42:13 发布

阅读量117

点赞数 1

CC 4.0 BY-SA版权

文章标签：算法 leetcode 职场和发展

本文链接：https://blog.youkuaiyun.com/ranzhiyimu/article/details/147051136

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        dp=[[1 for _ in range(n)]  for _ in range(m)] 
        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[-1][-1]