Node.js)백준 1158번: 요세푸스 문제

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

1158번: 요세푸스 문제

const fs = require('fs');
const [N, K] = fs.readFileSync("./dev/stdin").toString().trim().split(" ").map(v => +v);


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

class Queue {
  constructor() {
    this.head = null;
    this.tail = null;
    this.length = null;
  }

  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 answer = [];
let q = new Queue();
let cnt = 1;

for (let i = 1; i <= N; i++) {
  q.push(i);
}


while (q.length > 0) {
  let now = q.pop();
  if (cnt == K) {
    answer.push(now)
    cnt = 1;
  } else {
    q.push(now)
    cnt++
  }
}

console.log('<' + answer.join(', ') + '>')