题解 | #走方格的方案数#
走方格的方案数
http://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
let arr = readline().split(" ");
let m = Number(arr[0]);
let n = Number(arr[1]);
let min = Math.min(m, n);
let chengji = 1;
let fenmu = 1;
for (let i = 0; i < min; i++) {
chengji = chengji * ( m + n-i);
}
for (let j = 1; j <= min; j++) {
fenmu = fenmu * j;
}
console.log(chengji / fenmu);
数学解了
