README

Author: theabbie

README.md

@@ -1,2 +1,7 @@
 # leetcode
-My Leetcode Solutions
+
+![image](https://user-images.githubusercontent.com/17960677/163023814-113c3f1c-fa8e-47d7-a747-27b48fb25496.png)
+
+> My Leetcode Solutions
+
+This is a dump of all my accepted leetcode solutions, almost all solutions are written in Python, this is autogenerated using this tool, https://github.com/theabbie/leetcode_dump

clone-graph.py

@@ -11,16 +11,14 @@ def cloneGraph(self, node: 'Node') -> 'Node':
         if not node:
             return node
         nodemap = {}
-        nodemap[node] = Node(val = node.val)
+        nodemap[node.val] = Node(val = node.val)
         paths = [node]
         while len(paths) > 0:
             curr = paths.pop()
-            currcopy = nodemap[curr]
+            currcopy = nodemap[curr.val]
             for nbr in curr.neighbors:
-                if nbr in nodemap:
-                    currcopy.neighbors.append(nodemap[nbr])
-                else:
+                if nbr.val not in nodemap:
                     paths.append(nbr)
-                    nodemap[nbr] = Node(val = nbr.val)
-                    currcopy.neighbors.append(nodemap[nbr])
-        return nodemap[node]
+                    nodemap[nbr.val] = Node(val = nbr.val)
+                currcopy.neighbors.append(nodemap[nbr.val])
+        return nodemap[node.val]