题解 | #走方格的方案数#

const readline = require("readline");

const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout,
});
rl.on("line", function (line) {
    getResult(+line.split(" ")[0], +line.split(" ")[1])
});
function getResult(n, m) {
    let dp = new Array(n + 1).fill(0).map(() => new Array(m + 1));
    for (let i = 0; i <= n; i++) {
        dp[i][0] = 1;
    }
    for (let j = 0; j <= m; j++) {
        dp[0][j] = 1;
    }
    for (let i = 1; i <= n; i++) {
        for (let j = 1; j <= m; j++) {
            dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
        }
    }
    console.log(dp[n][m]);
}