class Solution:
def uniquePaths(self, m: int, n: int) -> int:
#dp[i][j]表示到达i,j的路径数
#初始化
dp = [[0]*n for _ in range(m)]
for i in range(m):
for j in range(n):
if i == 0 or j == 0:
dp[i][j] = 1
elif i > 0 and j > 0:
#递推公式
dp[i][j] = dp[i-1][j] + dp[i][j-1]
return dp[m-1][n-1]
62. 不同路径
最新推荐文章于 2024-07-15 22:10:26 发布