💀 [133] First dfs, headache ...

Author: enkr1

133/gpt_solution.js

@@ -0,0 +1,44 @@
+class Node {
+  constructor(val) {
+    this.val = val;
+    this.neighbors = [];
+  }
+}
+
+/**
+* @param {Node} node
+* @return {Node}
+*/
+var cloneGraph = function (node) {
+  if (!node) return node;
+
+  const visited = new Map();
+
+  const cloneNode = (oldNode) => {
+    if (visited.has(oldNode.val)) {
+      return visited.get(oldNode.val);
+    }
+
+    const newNode = new Node(oldNode.val);
+    visited.set(oldNode.val, newNode);
+    /*
+
+    > visited
+    Map(4) {
+      1 => Node { val: 1, neighbors: [] },
+      2 => Node { val: 2, neighbors: [ [Node] ] },
+      3 => Node { val: 3, neighbors: [ [Node] ] },
+      4 => Node { val: 4, neighbors: [] }
+    }
+
+    */
+
+    for (let neighbor of oldNode.neighbors) {
+      newNode.neighbors.push(cloneNode(neighbor));
+    }
+
+    return newNode;
+  };
+
+  return cloneNode(node);
+};

133/solution.js

@@ -0,0 +1,41 @@
+class Node {
+  constructor(val, neighbors) {
+    this.val = val === undefined ? 0 : val;
+    this.neighbors = neighbors === undefined ? [] : neighbors;
+  }
+};
+
+/**
+ * @param {Node} node
+ * @return {Node}
+ */
+var cloneGraph = function (node) {
+  if (!node) return node;
+  let map = new Map();
+
+  // closeNode
+  const dfs = (oldNode) => {
+    if (map.has(oldNode.val)) {
+      console.log("all saved")
+      console.log(oldNode)
+      return map.get(oldNode.val);
+    }
+
+    let copy = new Node(oldNode.val)
+    map.set(oldNode.val, copy)
+
+    console.log("> map")
+    console.log(map)
+
+    for (let nei of oldNode.neighbors) {
+      copy.neighbors.push(dfs(nei));
+    }
+
+    return copy;
+  }
+
+  return dfs(node);
+};
+
+// let n1= new Node(1, [new Node()])
+// cloneGraph