class Soluiton:
def unique(self,m,n):
if m==0 or n==0:
return 1
cache=[ [1]*n for _ in range(m)]
for i in range(1,m):
for i in range(1,n):
cache[i][j]=cache[i-1][j]+cache[i][j-1]
return cache[-1][-1]
不同路径python
最新推荐文章于 2023-05-14 05:58:36 发布