Clone an undirected graph. Each node in the graph contains a labe
and a list of its neighbors
.
/*
* @lc app=leetcode id=133 lang=cpp
*
* [133] Clone Graph
*/
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> neighbors;
Node() {}
Node(int _val, vector<Node*> _neighbors) {
val = _val;
neighbors = _neighbors;
}
};
*/
class Solution {
public:
Node* cloneGraph(Node* node) {
unordered_map<Node*, Node*> m;
queue<Node*> q;
m[node] = new Node(node->val);
q.push(node);
while (!q.empty()) {
const auto cur = q.front();
q.pop();
for (const auto nei : cur->neighbors) {
if (!m.count(nei)) {
m[nei] = new Node(nei->val);
q.push(nei);
}
(m[cur]->neighbors).push_back(m[nei]);
}
}
return m[node];
}
};