-
Notifications
You must be signed in to change notification settings - Fork 0
/
Clone Graph.cpp
42 lines (39 loc) · 958 Bytes
/
Clone Graph.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <iostream>
#include <unordered_map>
#include <vector>
class Node {
public:
int val;
std::vector<Node *> neighbors;
Node() {
val = 0;
neighbors = std::vector<Node *>();
}
Node(int _val) {
val = _val;
neighbors = std::vector<Node *>();
}
Node(int _val, std::vector<Node *> _neighbors) {
val = _val;
neighbors = _neighbors;
}
};
class Solution {
public:
Node *helper(Node *node, std::unordered_map<Node *, Node *> &map) {
if (!map.count(node)) {
map[node] = new Node(node->val);
for (Node *neighbor : node->neighbors) {
map[node]->neighbors.push_back(helper(neighbor, map));
}
}
return map[node];
}
Node *cloneGraph(Node *node) {
if (!node) {
return node;
}
std::unordered_map<Node *, Node *> map;
return helper(node, map);
}
};