题解 | #不同路径的数目(一)#
不同路径的数目(一)
https://www.nowcoder.com/practice/166eaff8439d4cd898e3ba933fbc6358
def uniquePaths(self , m: int, n: int) -> int:
last = 1
for i in range(1, n):
last = last * (m + i - 1) // i
return last
