1. 題目

給定無向連通圖中一個節(jié)點的引用，返回該圖的深拷貝（克隆）。圖中的每個節(jié)點都包含它的值 val（Int） 和其鄰居的列表（list[Node]）。

class Node { public:int val;vector<Node*> neighbors;Node() {}Node(int _val, vector<Node*> _neighbors) {val = _val;neighbors = _neighbors;} };

2. 解題

2.1 DFS

class Solution {Node* visited[101] = {NULL}; public:Node* cloneGraph(Node* node) {if(!node) return NULL;int size = node->neighbors.size();Node *root = new Node(node->val, vector<Node*> {});visited[node->val] = root;for (int i = 0; i < size; i++) {if (!visited[node->neighbors[i]->val])root->neighbors.push_back(cloneGraph(node->neighbors[i]));elseroot->neighbors.push_back(visited[node->neighbors[i]->val]);}return root;} };

2.2 BFS

class Solution {bool visited[101] = {0}; public:Node* cloneGraph(Node* node) {if(!node) return NULL;unordered_map<int, Node*> m;//新節(jié)點值和它自己的指針unordered_map<Node*, vector<int>> nhb;//一個節(jié)點對應(yīng)的鄰居的節(jié)點值queue<Node*> q;q.push(node);Node *root, *ans;visited[node->val] = 1;int i = -1, n;while(!q.empty()){n = q.front()->neighbors.size();root = new Node(q.front()->val, vector<Node*> {});if(i == -1)ans = root;m[q.front()->val] = root;for(i = 0; i < n; i++){nhb[root].push_back(q.front()->neighbors[i]->val);if(!visited[q.front()->neighbors[i]->val]){q.push(q.front()->neighbors[i]);visited[q.front()->neighbors[i]->val] = 1;}}q.pop();}for(auto it = nhb.begin(); it != nhb.end(); ++it){n = it->second.size();for(i = 0; i < n; i++){it->first->neighbors.push_back(m[it->second[i]]);}}return ans;} };

總結(jié)

以上是生活随笔為你收集整理的LeetCode 133. 克隆图（图的BFS/DFS）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。