动态规划
class Solution:
def uniquePaths(self, m, n):
dp = [[1] * n for _ in range(m)]
for i in range(1, m):
for j in range(1, n):
dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
return dp[m - 1][n - 1]
初始值设为1(第0行和第0列的到达方式只有1种)