class Solution:
def uniquePaths(self, m: int, n: int) -> int:
fn = [[0] * n for _ in range(m)]
for i in range(m):
for j in range(n):
if i == 0 or j == 0:
fn[i][j] = 1
else:
fn[i][j] = fn[i-1][j] + fn[i][j-1]
return fn[-1][-1]
# 62. 不同路径
最新推荐文章于 2024-04-18 21:43:50 发布