[백준 | 실버 1 | JavaScript] 2667번, 단지 번호 붙이기

 

Link

2667번 - 단지 번호 붙이기

 

---

문제

풀이

(1) DFS 재귀

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

let idx = 0;
const N = Number(input[idx++]);
const map = Array.from({ length: N }, () => []);
const visited = Array.from({ length: N }, () =>
  Array.from({ length: N }, () => false)
);
const answers = [];

const dr = [0, 1, 0, -1];
const dc = [1, 0, -1, 0];

for (let n = 0; n < N; n++) {
  map[n] = input[idx++].split("").map(Number);
}

const dfsRecursive = (r, c) => {
  visited[r][c] = true;
  let count = 1;

  for (let d = 0; d < 4; d++) {
    const tr = r + dr[d];
    const tc = c + dc[d];

    if (tr < 0 || tc < 0 || tr >= N || tc >= N) continue;
    if (visited[tr][tc]) continue;
    if (map[tr][tc] === 0) continue;

    count += dfsRecursive(tr, tc);
  }

  return count;
};

for (let i = 0; i < N; i++) {
  for (let j = 0; j < N; j++) {
    if (visited[i][j]) continue;
    if (map[i][j] === 0) continue;

    answers.push(dfsRecursive(i, j));
  }
}

console.log(answers.length);
answers.sort((a, b) => a - b).map((item) => console.log(item));