题解 | #明明的随机数#

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
    var tempAns;
    let isFirst = false;
    let j = 0;
    while ((line = await readline())) {
        if (!isFirst) {
            tempAns = new Array(Number(line));    
            isFirst = true;  
        } else {
            if (tempAns.indexOf(Number(line)) < 0) {
                let cIn = j;
                while (cIn >= 0 && tempAns[cIn] > Number(line)) {
                    tempAns[cIn + 1] = tempAns[cIn];
                    cIn--;
                }
                tempAns[cIn+1] = Number(line);
                j++;
            }   
        }    
    }
    tempAns.shift();
    console.log(tempAns.join("\n"));
})();

输入模式比较抓马

算法简单， 核心是： 插入排序