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 / \ \_/
思路 BFS
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if (!node) return node;
unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> imap;
queue<UndirectedGraphNode*> ique;
UndirectedGraphNode* nodeCpoy = new UndirectedGraphNode(node->label);
ique.push(node);
imap[node] = nodeCpoy;
while (!ique.empty()){
UndirectedGraphNode* p = ique.front();
ique.pop();
for (int i = 0; i < p->neighbors.size(); i++){
UndirectedGraphNode *cur = p->neighbors[i];
if (imap.find(cur) == imap.end()){
UndirectedGraphNode *tmp = new UndirectedGraphNode(cur->label);
imap[cur] = tmp;
imap[p]->neighbors.push_back(tmp);
ique.push(cur);
}
else
imap[p]->neighbors.push_back(imap[cur]);
}
}
return nodeCpoy;
}
};