一个M乘N的网格,从(0,0)位置走到(m,n),只能向下或者向右走,有多少种走法
function main(num1, num2) {
num1 = num1 + 1;
num2 = num2 + 1;
var result = new Array(num1);
var num1_t = num1;
while (num1_t--) {
result[num1_t] = new Array(num2);
}
//在节点便历之前必须先对边线上的节点进行赋值
for (var i = 0; i < num1; i++) {
result[i][0] = 1;
}
for (var j = 0; j < num2; j++) {
result[0][j] = 1;
}
//依次计算里面的节点的值
for (var m = 1; m < num1; m++) {
for (var n = 1; n < num2; n++) {
result[m][n] = result[m - 1][n] + result[m][n - 1];
}
}
return result[num1-1][num2-1];
}