114. Unique Paths

最新推荐文章于 2022-12-17 10:35:17 发布

算法导论我去

最新推荐文章于 2022-12-17 10:35:17 发布

阅读量194

点赞数

分类专栏： lintcode

本文链接：https://blog.csdn.net/u010327109/article/details/78884242

版权

lintcode 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

class Solution:
    """
    @param: m: positive integer (1 <= m <= 100)
    @param: n: positive integer (1 <= n <= 100)
    @return: An integer
    """
    def uniquePaths(self, m, n):
        # write your code here
        f=[[0]*n]*m
        for i in range(n):
            f[0][i]=1
        for i in range(m):
            f[i][0]=1
        for i in range(1,m):
            for j in range(1,n):
                f[i][j]=f[i][j-1]+f[i][j]
        return f[m-1][n-1]