leetcode 62. Unique Paths DP

最新推荐文章于 2024-07-26 10:47:39 发布

贫嘴小李子的幸福生活

最新推荐文章于 2024-07-26 10:47:39 发布

阅读量170

点赞数

分类专栏： Python足迹

本文链接：https://blog.csdn.net/u013491262/article/details/73177060

版权

Python足迹专栏收录该内容

48 篇文章 0 订阅

订阅专栏

A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below).

How many possible unique paths are there?

Above is a 3 x 7 grid. How many possible unique paths are there?

class Solution(object):
    def uniquePaths(self, m, n):
        dp = [[0]*n]*m
        for i in range(0 , m):
            for j in range(0 , n):
                if i == 0 or j == 0:
                    dp[i][j] = 1
                else:
                    dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[m-1][n-1]

if __name__ == '__main__':
    s = Solution()
    print(s.uniquePaths(3,7))