Time: 11 ms (17.94%), Space: 8.9 MB (24.17%) - LeetHub

Author: JanaSabuj

clone-graph/clone-graph.cpp

@@ -0,0 +1,42 @@
+/*
+// Definition for a Node.
+class Node {
+public:
+    int val;
+    vector<Node*> neighbors;
+    Node() {
+        val = 0;
+        neighbors = vector<Node*>();
+    }
+    Node(int _val) {
+        val = _val;
+        neighbors = vector<Node*>();
+    }
+    Node(int _val, vector<Node*> _neighbors) {
+        val = _val;
+        neighbors = _neighbors;
+    }
+};
+*/
+
+class Solution {
+    unordered_map<Node*, Node*> mp;
+public:
+    Node* cloneGraph(Node* node) {
+        if(node == NULL)
+            return NULL;
+        
+        if(mp.find(node) != mp.end())
+            return mp[node];
+        
+        Node* t = new Node(node->val);
+        mp[node] = t;// node to clone mapping
+                
+        for(auto& n: node->neighbors){            
+            t->neighbors.push_back(cloneGraph(n));
+        }
+
+        
+        return t;
+    }
+};