[백준 10828번] 구현 - 스택

✨ 문제 ✨

✨ 정답 ✨

const { notDeepEqual } = require("assert");
const { count } = require("console");
const fs = require("fs");
const { nextTick } = require("process");
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');

let N=+input.shift();

let answerArray=[];

let stackArray=[];
for (let i=0;i<N;i++){
  let commandWords=input[i].split(' ').map((el)=>el.trim())
  if (commandWords[0]==='push'){
    stackArray.push(commandWords[1])
  }else if (commandWords[0]==='top'){
    if (stackArray.length>0){
      answerArray.push(stackArray[stackArray.length-1])
    }else{
      answerArray.push(-1)
    }
  }else if (commandWords[0]==='size'){
    answerArray.push(stackArray.length);
  }else if (commandWords[0]==='empty'){
    if (stackArray.length===0){
      answerArray.push(1)
    }else{
      answerArray.push(0)
    }
  }else if (commandWords[0]==='pop'){
    if (stackArray.length>0){
      answerArray.push(stackArray.pop())
    }else{
      answerArray.push(-1)
    }

  }
}

console.log(answerArray.join('\n'))

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡