Merge pull request #640 from eric-hjh/main

[황장현] 95차 라이브 코테 제출

Author: gmlrude

live9/test95/문제1/황장현.js

@@ -0,0 +1,32 @@
+function solution(k, dungeons) {
+  let maxDepth = 0;
+
+  function DFS(현재피로도, currentDepth, visited) {
+    maxDepth = Math.max(maxDepth, currentDepth);
+
+    for (let i = 0; i < dungeons.length; i++) {
+      if (visited[i]) continue;
+
+      const [최소필요피로도, 소모피로도] = dungeons[i];
+
+      if (현재피로도 >= 최소필요피로도) {
+        visited[i] = true;
+        DFS(현재피로도 - 소모피로도, currentDepth + 1, visited);
+        visited[i] = false;
+      }
+    }
+  }
+
+  const visited = Array(dungeons.length).fill(false);
+  DFS(k, 0, visited);
+
+  return maxDepth;
+}
+
+console.log(
+  solution(80, [
+    [80, 20],
+    [50, 40],
+    [30, 10],
+  ])
+);

live9/test95/문제2/황장현.js

@@ -0,0 +1,47 @@
+function solution(n, wires) {
+  const graph = Array.from({ length: n + 1 }, () => []);
+
+  for (let [w1, w2] of wires) {
+    graph[w1].push(w2);
+    graph[w2].push(w1);
+  }
+
+  let min = Infinity;
+
+  for (let [cutA, cutB] of wires) {
+    const visited = Array(n + 1).fill(false);
+
+    function DFS(node) {
+      visited[node] = true;
+      let count = 1;
+
+      for (const next of graph[node]) {
+        if (!visited[next] && !(next === cutB)) {
+          count += DFS(next);
+        }
+      }
+
+      return count;
+    }
+
+    const countA = DFS(cutA);
+    const countB = n - countA;
+
+    min = Math.min(min, Math.abs(countA - countB));
+  }
+
+  return min;
+}
+
+console.log(
+  solution(9, [
+    [1, 3],
+    [2, 3],
+    [3, 4],
+    [4, 5],
+    [4, 6],
+    [4, 7],
+    [7, 8],
+    [7, 9],
+  ])
+);