题目描述:
题解:动态规划
1.dp表示每个位置到终点的路径数,终点位置和终点位置所在的行和列dp的值都为1。
2.其他位置dp[i][j]=dp[i+1][j]+dp[i][j+1]
以题目示例1为例:
class Solution: def uniquePaths(self, m: int, n: int) -> int: dp = [[0 for i in range(n)]for j in range(m)] for i in range(n): dp[m-1][i] = 1 for i in range(m): dp[i][n-1] = 1 for i in range(m-2,-1,-1): for j in range(n-2,-1,-1): dp[i][j] = dp[i+1][j]+dp[i][j+1] return dp[0][0]