62.不同路径

发表于 分类于
这是文章开头，显示在主页面，详情请点击此处。
1
2
3
4
5
6
7
8
9
class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        d = [[1 for _ in range(n)] for _ in range(m)]
        temp = 1
        for i in range(1,m):
            for j in range(1,n):
                d[i][j] = d[i-1][j] + d[i][j-1]
                temp = d[i][j]
        return temp