๐Ÿ”’Algorithm

๋ฐฑ์ค€[node.js] > 1181๋ฒˆ ๋‹จ์–ด ์ •๋ ฌ

devWarrior 2024. 11. 12. 22:20

๋ฌธ์ œ๋งํฌ

https://www.acmicpc.net/problem/1181

 

๋ฌธ์ œํ’€์ด

set ๊ฐ์ฒด๋ฅผ ํ†ตํ•ด ์ค‘๋ณต๋œ ๋ฌธ์ž์—ด์„ ์ œ๊ฑฐํ•˜๊ณ 

sort()๋กœ ์•ŒํŒŒ๋ฒณ ์ˆœ์„œ๋Œ€๋กœ ๋ฌธ์ž๋ฅผ ๋ฐฐ์—ด ํ•œ ๋’ค

๋‹ค์‹œ ๊ธ€์ž ๊ธธ์ด๋ฅผ ๋น„๊ตํ•˜์—ฌ ์ •๋ ฌํ•˜์˜€๋‹ค.

๋”ฑ๋”ฑํžˆ ์–ด๋ ค์›€ ์—†์ด ํ’€ ์ˆ˜ ์žˆ์—ˆ๋‹ค.

let fs = require("fs");
let input = fs.readFileSync("/dev/stdin").toString().trim().split("\n");

let [n, ...words] = input;

let set = new Set();

words.forEach((word) => {
    set.add(word);
});

let arr = [...set];
arr.sort();
arr.sort((a, b) => {
    if (a.length !== b.length) {
        if (a.length > b.length) {
            return 1;
        } else {
            return -1;
        }
    }
});

for (let i = 0; i < arr.length; ++i) {
    console.log(arr[i]);
}