62. 不同路径(LeetCode-力扣-Python)

最新推荐文章于 2024-10-08 10:36:00 发布

zy20221209

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量185

点赞数 3

文章标签： leetcode python 算法

本文链接：https://blog.csdn.net/zy20221209/article/details/139126975

版权

class Solution(object):
    def uniquePaths(self, m, n):
        """
        :type m: int
        :type n: int
        :rtype: int
        """
        dp = [[0 for j in range(n)] for i in range(m)]
        dp[0][0] = 1
        if n > 1:
            dp[0][1] = 1
        if m > 1:
            dp[1][0] = 1
        for i in range(m):
            for j in range(n):
                if i != 0 and j != 0:
                    dp[i][j] = dp[i-1][j]+dp[i][j-1]
                elif i == 0 and j != 0:
                    dp[i][j] = dp[i][j-1]
                elif i != 0 and j == 0:
                    dp[i][j] = dp[i-1][j]
        return (dp[m-1][n-1])