🎲 백준 1021번 회전하는 큐

📣 문제

🎨 참고 코드

코드

const fs = require('fs'); 
const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');
const [N, M] = input.shift().split(" ").map(Number);
const nums = input.shift().split(" ").map(Number);

const queue = new Array(N).fill(0).map((el, index) => index + 1);
let answer = 0;

for (let i = 0; i < M; i++) {
  const target = nums[i];

  if (target === queue[0]) {

    queue.shift();
    continue;
  }

  let targetIndex = queue.indexOf(target);
  let mid = queue.length / 2;

  if (targetIndex <= mid) {
    for (let j = 0; j < targetIndex; j++) {
      queue.push(queue.shift());
      answer++;
    }
  } else {
    for (let j = 0; j < queue.length - targetIndex; j++) {
      queue.unshift(queue.pop());
      answer++;
    }
  }
  queue.shift();
}

console.log(answer);