一个机器人位于m*n格的左上角,每次只能向右或向下移动一步,求移动到右下角格子,总共有多少条路径?
def count(m,n):
res=[[1 for i in range (n)] for j in range(m)]
for i in renge(1,m):
for j in range (1,n):
res[i][j]=res[i][j-1]+res[i-1][j]
return res[i][j]
一个机器人位于m*n格的左上角,每次只能向右或向下移动一步,求移动到右下角格子,总共有多少条路径?
def count(m,n):
res=[[1 for i in range (n)] for j in range(m)]
for i in renge(1,m):
for j in range (1,n):
res[i][j]=res[i][j-1]+res[i-1][j]
return res[i][j]