15주차 문제풀이

grap3fruit · grap3fruit · commit d1c9fff17bfe · 2021-01-05T21:46:01.000+09:00
diff --git a/src/grap3fruit/js/goorm/12981.js b/src/grap3fruit/js/goorm/12981.js
@@ -0,0 +1,34 @@
+const check = (words, n, word, idx, visited) => {
+  if (visited.includes(word)) {
+    return [(idx % n) + 1, Math.ceil((idx + 1) / n)];
+  }
+  if (idx > 0) {
+    if (words[idx - 1][words[idx - 1].length - 1] !== word[0]) {
+      return [(idx % n) + 1, Math.ceil((idx + 1) / n)];
+    }
+  }
+  return null;
+};
+
+function solution(n, words) {
+  let answer = null;
+  const visited = [];
+
+  words.forEach((word, idx) => {
+    if (!answer) {
+      answer = check(words, n, word, idx, visited);
+      visited.push(word);
+    }
+  });
+  if (!answer) {
+    answer = [0, 0];
+  }
+  return answer;
+}
+
+const n = 2;
+const words = ['hello', 'two'];
+// const words = ['hello', 'one', 'even', 'never', 'now', 'world', 'draw'];
+// const words = ['tank', 'kick', 'know', 'wheel', 'land', 'dream', 'mother', 'robot', 'tank'];
+
+solution(n, words);
diff --git a/src/grap3fruit/js/goorm/42578.js b/src/grap3fruit/js/goorm/42578.js
@@ -0,0 +1,26 @@
+function solution(clothes) {
+  let answer = 1;
+  const data = {};
+
+  clothes.forEach((cloth) => {
+    if (!data[cloth[1]]) {
+      return (data[cloth[1]] = [cloth[0]]);
+    }
+    data[cloth[1]].push(cloth[0]);
+  });
+
+  for (const el in data) {
+    answer *= data[el].length + 1;
+  }
+  answer -= 1;
+
+  return answer;
+}
+
+const clothes = [
+  ['yellow_hat', 'headgear'],
+  ['blue_sunglasses', 'eyewear'],
+  ['green_turban', 'headgear'],
+];
+
+console.log(solution(clothes));
diff --git a/src/grap3fruit/js/goorm/43162.js b/src/grap3fruit/js/goorm/43162.js
@@ -0,0 +1,54 @@
+const bfs = (computers, root) => {
+  const visited = [root];
+  let q = [computers[root]];
+
+  while (q.length > 0) {
+    let item = q.shift();
+
+    item.forEach((el, idx) => {
+      if (el === 1 && !visited.includes(idx)) {
+        q.push(computers[idx]);
+        visited.push(idx);
+      }
+    });
+  }
+
+  return visited;
+};
+
+function solution(n, computers) {
+  let answer = 0;
+  const visited = [];
+
+  computers.forEach((_, idx) => {
+    let visitFlag = false;
+    visited.forEach((el) => {
+      if (el.includes(idx)) {
+        visitFlag = true;
+      }
+    });
+
+    if (!visitFlag) {
+      const newVisited = bfs(computers, idx);
+      visited.push(newVisited);
+    }
+  });
+
+  console.log(visited.length);
+  answer = visited.length;
+  return answer;
+}
+
+const n = 3;
+const computers = [
+  [1, 1, 0],
+  [1, 1, 0],
+  [0, 0, 1],
+];
+// const computers = [
+//   [1, 1, 0],
+//   [1, 1, 1],
+//   [0, 1, 1],
+// ];
+
+solution(n, computers);
