133. Clone Graph
Clone an undirected graph. Each node in the graph contains a label
and a list of its neighbors
.
OJ's undirected graph serialization:
Nodes are labeled uniquely.
We use#
as a separator for each node, and
,
as a separator for node label and each neighbor of the node.
As an example, consider the serialized graph {0,1,2#1,2#2,2}
.
The graph has a total of three nodes, and therefore contains three parts as separated by #
.
- First node is labeled as
0
. Connect node0
to both nodes1
and2
. - Second node is labeled as
1
. Connect node1
to node2
. - Third node is labeled as
2
. Connect node2
to node2
(itself), thus forming a self-cycle.
Visually, the graph looks like the following:
1 / \ / \ 0 --- 2 / \ \_/
/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*/
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
map<int,UndirectedGraphNode *> hashmap;
return clone(node,hashmap);
}
private:
UndirectedGraphNode *clone (UndirectedGraphNode *node,map<int,UndirectedGraphNode * > &hashmap){
if(node == NULL) return NULL;
if(hashmap.find(node->label)!=hashmap.end()) return hashmap[node->label];
UndirectedGraphNode *res = new UndirectedGraphNode (node->label);
hashmap[node->label] = res ;
for(int i = 0 ;i <node->neighbors.size();i++){
UndirectedGraphNode *neib = clone(node->neighbors[i],hashmap);
res->neighbors.push_back(neib);
}
return res ;
}
};