Leetcode 133 Clone Graph
Leetcode 133 Clone Graph
triplebee
发布于 2018-01-12 14:52:21
发布于 2018-01-12 14:52:21
文章被收录于专栏：计算机视觉与深度学习基础
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 node0to both nodes1and2. - Second node is labeled as
1. Connect node1to node2. - Third node is labeled as
2. Connect node2to node2(itself), thus forming a self-cycle.
Visually, the graph looks like the following:
1
/ \
/ \
0 --- 2
/ \
\_/Subscribe to see which companies asked this question
题意很明确，克隆图。
dfs，用map记录克隆过的点，easy
/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*/
class Solution {
public:
UndirectedGraphNode* dfs(UndirectedGraphNode* now, unordered_map<UndirectedGraphNode*, UndirectedGraphNode*>& mp)
{
if(mp.find(now) != mp.end()) return mp[now];
UndirectedGraphNode* clone = new UndirectedGraphNode(now->label);
mp[now] = clone;
for(int i=0;i < now->neighbors.size(); i++)
{
UndirectedGraphNode* t = dfs(now->neighbors[i],mp);
if(t) clone->neighbors.push_back(t);
}
return clone;
}
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if(!node) return NULL;
unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> mp;
return dfs(node, mp);
}
};本文参与 腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。
原始发表：2016-11-03 ，如有侵权请联系 cloudcommunity@tencent.com 删除
评论
登录后参与评论
推荐阅读
腾讯云开发者
