[백준 1874] 스택 - 스택 수열

✨ 문제 ✨

✨ 정답 ✨

const fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./예제.txt";
let input = fs.readFileSync(filePath).toString().trim().split('\n');

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


const iter = +input.shift();

let ans = [];
let stack = [];
let stackNum = 1;

for(let i = 0; i < iter; i++){
    let num = +input[i];
 
    while(stackNum <= num){
        stack.push(stackNum);
        stackNum++;
        ans.push("+");
    }
    

    let stackPop = stack.pop();
    ans.push("-");
 
    if(stackPop !== num){
        ans = ["NO"];
        break;
    }   
}

console.log(ans.join("\n"));

🧵 참고한 정답지 🧵

https://velog.io/@rkio/%EB%B0%B1%EC%A4%80-Javascript-1874

💡💡 기억해야 할 점 💡💡