Node.js) 백준 15656번: N과 M (7)

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

15656번: N과 M (7)

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n").map(v=>v.split(' ').map(Number));
const [N,M] = input[0]
const nums = input[1].sort((a,b)=>a-b)
const answer = [];

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;
    } else {
      this.tail.next = node;
    }

    this.tail = node;
    this.length += 1;
  }

  pop() {
    const popItem = this.head.item;
    this.head = this.head.next;
    this.length -= 1;
    return popItem;
  }
}


let q = new Queue();
for(let i = 0; i<N; i++){
  q.push({
      arr:[nums[i]],
      cnt:1
    });
  }

while(q.length>0){
  const {arr,cnt} = q.pop();
  if(cnt==M){
    answer.push(arr.join(' '))
  }else{
    for(let i = 0; i<N; i++){
      q.push({
        arr:[...arr,nums[i]],
        cnt:cnt+1,
      });
    }
  }
}

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