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 node 0 to both nodes 1 and 2.
- Second node is labeled as 1. Connect node 1 to node 2.
- Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle. Visually, the graph looks like the following:
1
/ \
/ \
0 --- 2
/ \
\_/
解题思路:
一边遍历图一边复制图。为了防止重复遍历,使用一个hash表来记录已经创建了的节点。这里使用了DFS来遍历图并进行复制,使用递归实现。
代码如下,运行时间72ms:
/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*/
class Solution {
private:
unordered_map<int, UndirectedGraphNode *> graphNodes;
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if(node == NULL)
return NULL;
if(graphNodes.find(node->label) == graphNodes.end()) {
UndirectedGraphNode *cnode = new UndirectedGraphNode(node->label);
graphNodes[node->label] = cnode;
int size(node->neighbors.size());
if(size > 0) {
cnode->neighbors.resize(size);
for(int i = 0; i < size; ++i) {
cnode->neighbors[i] = cloneGraph(node->neighbors[i]);
}
}
return cnode;
}
else
return graphNodes[node->label];
}
};