class Solution:
def uniquePaths(self, m: int, n: int) -> int:
#动态规划dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
#dp[i][j] 表示从(0,0)出发, 到(i, j) 有dp[i][j]条不同的路径
#初始化dp数组
dp=[[1 for i in range(n)] for j 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]