题解 | 数楼梯

数楼梯

https://www.nowcoder.com/practice/c7e5f164fa5d471f8f83c90fe4ee3f05

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void async function () {
    let line = await readline()
    let n = Number(line)
    const ans = climbStairs(n)
    console.log(ans)
}()

const climbStairs = function(n){
    const MOD = 998244353;
    let dp = []
    dp[0] = 1
    dp[1] = 1
    for(let i = 2; i<=n; i++){
        dp[i] = (dp[i-1] +dp[i-2]) %MOD
    }
    return dp[n]
}

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务