Node.js) 백준 1992번 : 쿼드트리

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

1992번: 쿼드트리

스택으로 풀었음.

const fs = require('fs');
const [n,...arr] = fs.readFileSync("./dev/stdin").toString().trim().split("\n");

const N = +n
const board = arr.map(v=>v.split('').map(v=>+v))

class Node{
  constructor(item){
    this.item = item;
    this.next = null;
  }
}

class Stack{
  constructor(){
    this.topOfStack = null;
    this.length = 0;
  }

  push(item){
    const node = new Node(item);
    if(this.topOfStack!=null){
      node.next = this.topOfStack; 
    }
      this.topOfStack = node;
      this.length+=1;
  }

  pop(){
    if(this.length==0)return -1;
    const popItem = this.topOfStack;
    this.topOfStack = popItem.next;
    this.length-=1;

    return popItem.item
  }

  size(){
    return this.length;
  }

  empty(){
    if(this.length==0) return 1;
    else return 0;
  }

  top(){
    if(this.length==0)return -1;
    return this.topOfStack.item; 
  }
}


let answer =''
let stack = new Stack();
stack.push([0,0,N])
while(!stack.empty()){
  let temp = stack.pop();
  if(temp=='left') {
    answer='('+answer
  }
  else if(temp=='right') {
    answer=')'+answer;
  }
  else{
    const [y,x,n] = temp;
    
    let same = true;
    let first = board[y][x];
    for(let i = y; i<y+n; i++ ){
      for(let j = x; j<x+n; j++ ){
        if(board[i][j]!=first){
          same=false;
          break;
        }
      }
      if(!same)break;
    }
    if(same)answer=first+answer;
    else{
      stack.push('left')
      stack.push([y,x,n/2])
      stack.push([y,x+n/2,n/2])
      stack.push([y+n/2,x,n/2])
      stack.push([y+n/2,x+n/2,n/2])
      stack.push('right')
    }
  }

}

console.log(answer)