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]
01-14
392
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
01-13
332
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-09
385
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)