题解 | #不同路径的数目(一)#
不同路径的数目(一)
http://www.nowcoder.com/practice/166eaff8439d4cd898e3ba933fbc6358
#
#
# @param m int整型
# @param n int整型
# @return int整型
#
class Solution:
def uniquePaths(self , m , n ):
# write code here
mark = [[1]*n for i in range(m)]
for i in range(1,m):
for j in range(1,n):
mark[i][j] = mark[i-1][j] + mark[i][j-1]
return mark[m-1][n-1]