LeetCode:62. Unique Paths

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

XP-Code

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

阅读量109

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Wisimer/article/details/92835597

版权

LeetCode 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

LeetCode:62. Unique Paths

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 7 x 3 grid. How many possible unique paths are there?

Note: m and n will be at most 100.

Example 1:

Input: m = 3, n = 2
Output: 3
Explanation:
From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -> Right -> Down
2. Right -> Down -> Right
3. Down -> Right -> Right

Example 2:

Input: m = 7, n = 3
Output: 28

就是机器人从左上角走到右下角，每次只能向右或向下走一步，问有多少种走法。

思路：动态规划

很显然，到达右下角的前一步只能是它的上边或者左边那个格子。也就是下面这个图的两个红色方块位置。
last
到达这两个位置的所有路径个数之和就是最终要求的路径个数。按照这种思路往前推，可以得出达到某个位置的路径数为：

A(i,j) = A(i-1,j)+A(i,j-1) ，这里的(i,j)就是某个位置的坐标位置。

另外处理一下特殊情况，在第一行或者第一列的某一格，肯定只能有一种情况到达该位置。

Python 代码实现

class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        ans=0
        res={}
        if m==1 or n==1:
            ans=1
        else:
            for i in range(n):
                for j in range(m):
                    if i==0 or j==0:
                    	//第一行或第一列
                        res[(i,j)]=1
                    else:
                        res[(i,j)]=res[(i-1,j)]+res[(i,j-1)]
            ans=res[(n-1,m-1)]
        return ans