【Leetcode】Clone Graph
2014-06-03 20:51
267 查看
Clone an undirected graph. Each node in the graph contains a
OJ's undirected graph serialization:
Nodes are labeled uniquely.
We use
As an example, consider the serialized graph
The graph has a total of three nodes, and therefore contains three parts as separated by
First node is labeled as
Second node is labeled as
Third node is labeled as
Visually, the graph looks like the following:
View Code
借助hash表
labeland 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
0to both nodes
1and
2.
Second node is labeled as
1. Connect node
1to node
2.
Third node is labeled as
2. Connect node
2to 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) { unordered_map<UndirectedGraphNode *, UndirectedGraphNode *> map; if (node == nullptr) { return nullptr; } return clone(node, map); } private: UndirectedGraphNode *clone(UndirectedGraphNode *node, unordered_map<UndirectedGraphNode *, UndirectedGraphNode *> &map) { if (map.find(node) != map.end()) { return map[node]; } UndirectedGraphNode *new_node = new UndirectedGraphNode(node->label); map[node] = new_node; for (auto n : node->neighbors) { new_node->neighbors.push_back(clone(n, map)); } return new_node; } };
View Code
借助hash表
相关文章推荐
- LeetCode133——Clone Graph
- Clone Graph(LeetCode)
- [LeetCode]133 Clone Graph
- LeetCode Clone Graph
- LeetCode 133 Clone Graph
- 算法设计Week3 LeetCode Algorithms Problem #133 Clone Graph
- LeetCode-Clone Graph
- 【LeetCode】Clone Graph
- 【LeetCode】Clone Graph
- leetcode练习 Clone Graph
- LeetCode-Clone Graph
- leetcode:Clone Graph
- [LeetCode]Clone Graph
- leetcode: Clone Graph
- [LeetCode]Clone Graph
- [LeetCode] clone graph
- LeetCode[Graph]: Clone Graph
- leetcode 133 —— Clone Graph
- Leetcode #133 Clone Graph
- [LeetCode]题解(python):133-Clone Graph