feat: Solve clone-graph problem

Author: hu6r1s

clone-graph/hu6r1s.py

@@ -0,0 +1,28 @@
+"""
+# Definition for a Node.
+class Node:
+    def __init__(self, val = 0, neighbors = None):
+        self.val = val
+        self.neighbors = neighbors if neighbors is not None else []
+"""
+
+from typing import Optional
+class Solution:
+    def cloneGraph(self, node: Optional['Node']) -> Optional['Node']:
+        if not node:
+            return None
+
+        visited = [None] * 101
+        
+        def dfs(n):
+            if visited[n.val] is not None:
+                return visited[n.val]
+            
+            copy = Node(n.val, [])
+            visited[n.val] = copy
+            
+            for nei in n.neighbors:
+                copy.neighbors.append(dfs(nei))
+            return copy
+
+        return dfs(node)