【LeetCode】图论 graph（共20题）-CSDN博客

【133】Clone Graph （2019年3月9日，复习）

给定一个图，返回它的深拷贝。

题解：dfs 或者 bfs 都可以

 1 /*
 2 // Definition for a Node.
 3 class Node {
 4 public:
 5     int val;
 6     vector<Node*> neighbors;
 7 
 8     Node() {}
 9 
10     Node(int _val, vector<Node*> _neighbors) {
11         val = _val;
12         neighbors = _neighbors;
13     }
14 };
15 */
16 class Solution {
17 public:
18     Node* cloneGraph(Node* node) {
19         if (!node) {return node;}
20         unordered_map<Node*, Node*> memo;
21         Node* copy = new Node(node->val,  vector<Node*>{});
22         memo[node] = copy;
23         queue<Node*> que;
24         que.push(node);
25         unordered_set<Node*> visit;
26         visit.insert(node);
27         while (!que.empty()) {
28             Node* cur = que.front(); que.pop();
29             Node* copyCur = memo[cur];
30             for (auto& adj : cur->neighbors) {
31                 if (memo.find(adj) == memo.end()) {
32                     Node* copyAdj = new Node(adj->val, vector<Node*>{});
33                     memo[adj] = copyAdj;
34                 }
35                 copyCur->neighbors.push_back(memo[adj]);
36                 if (visit.find(adj) == visit.end()) {
37                     visit.insert(adj);
38                     que.push(adj);
39                 }
40             }
41         }
42         return copy;
43     }
44 };