Node.js) 백준 13549번: 숨바꼭질 3

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

13549번: 숨바꼭질 3

const fs = require("fs");
const [subin, bro] = fs
  .readFileSync("./dev/stdin")
  .toString()
  .trim()
  .split(" ")
  .map(Number);

if (subin == bro) process.exit(console.log(0));
if (subin > bro) process.exit(console.log(subin - bro));

let q = [];
q.push([subin, 0]);

let memo = new Array(100002).fill(false);
while (true) {
  const [now, sec] = q.shift();
  if (now == bro) {
    process.exit(console.log(sec));
  }
  //바로 텔포
  if (now > 0 && now < bro) {
    for (let i = now; i <= bro * 2; i += i) {
      if (i == bro) {
        process.exit(console.log(sec));
      } else {
        if (i + 1 <= 100001 && !memo[i + 1]) {
          q.push([i + 1, sec + 1]);
          memo[i + 1] = true;
        }
        if (i - 1 <= 100001 && !memo[i - 1]) {
          q.push([i - 1, sec + 1]);
          memo[i - 1] = true;
        }
      }
    }
  }

  if (now + 1 <= 100001 && !memo[now + 1]) {
    q.push([now + 1, sec + 1]);
    memo[now + 1] = true;
  }
  if (now - 1 >= 0 && !memo[now - 1]) {
    q.push([now - 1, sec + 1]);
    memo[now - 1] = true;
  }
}