# [leetcode] 133.Clone Graph

209人阅读 评论(0)

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
/ \
\_/


/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
*     int label;
*     vector<UndirectedGraphNode *> neighbors;
*     UndirectedGraphNode(int x) : label(x) {};
* };
*/
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if(node == NULL)return NULL;
UndirectedGraphNode *root = NULL;
cloneGraphRecur(root, node);
return root;
}
void cloneGraphRecur(UndirectedGraphNode *&root, UndirectedGraphNode *&node) {
root = new UndirectedGraphNode(node->label);
existNodes[node->label] = root;
for(auto neighbor:node->neighbors) {
if(existNodes.find(neighbor->label) == existNodes.end()){
UndirectedGraphNode *temp = NULL;
cloneGraphRecur(temp, neighbor);
root->neighbors.push_back(temp);
}
else root->neighbors.push_back(existNodes[neighbor->label]);
}
}
private:
unordered_map<int,UndirectedGraphNode*> existNodes;
};
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：51586次
• 积分：2793
• 等级：
• 排名：第12804名
• 原创：239篇
• 转载：0篇
• 译文：0篇
• 评论：5条
文章分类
最新评论