题解 | #蛇形矩阵#

蛇形矩阵

https://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e

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

void (async function () {
    // Write your code here
    while ((line = await readline())) {
        const n = parseInt(line);
        let x = 0;
        let list = [];
        for (let i = 0; i < n; i++) {
            const arr = [];
            for (let j = 0; j < n; j++) {
                if (i + 1 >= n - j) {
                    arr.push(++x);
                }
            }
            list.push(arr);
        }

        while (list.length) {
            const arr = []
            list.forEach((x, i) => {
                arr.push(x.pop())
            });
            list = list.filter(x => x.length)
            console.log(arr.join(' '));
        }
    }
})();

全部评论

相关推荐

评论
点赞
收藏
分享

创作者周榜

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