문제

내 코드

let fs = require("fs");
let input = fs.readFileSync("/dev/stdin").toString().trim();

const N = Number(input);

let answer = 0;
let row = Array.from({ length: N + 1 }, () => 0);

function check(L) {
  for (let i = 0; i < L; i++) {
    if (row[L] === row[i] || L - i === Math.abs(row[L] - row[i])) {
      return false;
    }
  }
  return true;
}

function DFS(L) {
  if (L === N) {
    answer++;
  } else {
    for (let i = 0; i < N; i++) {
      row[L] = i;
      if (check(L)) {
        DFS(L + 1);
      }
    }
  }
}

DFS(0);
console.log(answer);

깃허브 링크

https://github.com/highjoon/Algorithm/blob/master/BOJ/9663.js