6 lines
195 B
Python
6 lines
195 B
Python
def uniquePaths(m, n, i=0, j=0):
|
|
if i >= m or j >= n:
|
|
return 0
|
|
if i == m - 1 and j == n - 1:
|
|
return 1
|
|
return uniquePaths(m, n, i + 1, j) + uniquePaths(m, n, i, j + 1)
|