题解 | #走方格的方案数#
走方格的方案数
http://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
let str = null;
while(str = readline()) {
let arr = str.split(' ');
let n = parseInt(arr[0]);
for(let i = 1; i <= n; i++) {
for(let j = 1; j <= m; j++) {
table[j][i] = table[j][i-1] + table[j-1][i]
}
}
console.log(table[m][n])
}
while(str = readline()) {
let arr = str.split(' ');
let n = parseInt(arr[0]);
let m = parseInt(arr[1]);
//先填充矩阵的纵向，再填充矩阵的横向
let table = Array(m+1).fill(0).map(()=> Array(n+1).fill(1));for(let i = 1; i <= n; i++) {
for(let j = 1; j <= m; j++) {
table[j][i] = table[j][i-1] + table[j-1][i]
}
}
console.log(table[m][n])
}
