LeetCode 62. Unique Paths
考点 | 难度 |
---|---|
DP | Medium |
题目
There is a robot on an m x n
grid. The robot is initially located at the top-left corner (i.e., grid[0][0]
). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]
). The robot can only move either down or right at any point in time.
Given the two integers m
and n
, return the number of possible unique paths that the robot can take to reach the bottom-right corner.
The test cases are generated so that the answer will be less than or equal to 2 * 109.
思路
到[m][n]
的方法个数 = 到[m-1][n]
和[m][n-1]
的和。
答案
class Solution:
def uniquePaths(self, m, n):
dp = [[1]*n for i in range(m)]
for i, j in product(range(1, m), range(1, n)):
dp[i][j] = dp[i-1][j] + dp[i][j-1]
return dp[-1][-1]