Node.js) 백준 1966번 : 프린터 큐

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

1966번: 프린터 큐

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

for(let i = 0; i<N; i++){
    const [num,target] = arr.shift().split(' ');
    const priority = arr.shift().split(' ');
    docs.push([num,target,priority]);
}

class Node{
    constructor(item){
      this.item = item;
      this.next = null;
    }
  }
  
  class Queue{
    constructor(){
      this.head = null;
      this.tail = null;
      this.length = 0;
    }
  
    push(item){
      const node = new Node(item)
      if(this.head===null){
        this.head= node;
        this.head.next = null;
      }else{
        this.tail.next = node;
      }
  
      this.tail = node;
      this.length +=1;
    }
  
    pop(){
        if(this.empty()==1) return -1
      const popItem = this.head;
      this.head = this.head.next;
      this.length -=1;
      return popItem.item;
    }
  
    size(){
      return this.length;
    }
  
    empty(){
      if(this.size()==0){
        return 1;
      }else{
        return 0;
      }
    }
  
    front(){
      if(this.empty()==1) return -1;
      return this.head.item; 
    }
  
    back(){
      if(this.empty()==1) return -1;
      return this.tail.item; 
    }
  }
  




let answer = [];
docs.forEach(v=>{
    const [num,target,priority] = v;
    let q = new Queue();
    let priorityArr = [0,0,0,0,0,0,0,0,0,0];
    for(let i = 0; i<num; i++){
        q.push({index:i,priority:priority[i]});
        priorityArr[priority[i]]++;
    }
    

    function check(p){
        if(p==9) return true;
        for(let i = 9; i>p; i--){
            if(priorityArr[i]>0) return false;
        }
        return true;
    }
    let cnt = 0;
    while(true){
        
        let temp = q.pop();
        if(check(temp.priority)){
            cnt++;
            if(temp.index==target){
                answer.push(cnt)
                break; 
            }else{
                priorityArr[temp.priority]--; 
            }
        }else{
            q.push(temp);
        }
        
    }
})

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