leetcode-training/cpp/clone-graph.cpp at master · ldcduc/leetcode-training · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/* Problem url: https://leetcode.com/problems/clone-graph
 * Code by: ldcduc
 * */
/* Begin of Solution */
/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> neighbors;
    Node() {
        val = 0;
        neighbors = vector<Node*>();
    }
    Node(int _val) {
        val = _val;
        neighbors = vector<Node*>();
    }
    Node(int _val, vector<Node*> _neighbors) {
        val = _val;
        neighbors = _neighbors;
    }
};
*/

class Solution {
public:
    Node* cloneGraph(Node* node) {
        Node* result = NULL;
        if (node) {
            unordered_map<Node*, Node* > M;
            queue<Node*> Q;
            result = new Node(node->val);
            M[node] = result;
            Q.push(node);
            while (!Q.empty()) {
                node = Q.front();
                Q.pop();
                for (int i = 0; i < node->neighbors.size(); ++ i) {
                    Node* adj = node->neighbors[i];
                    if (M.count(adj) == 0) {
                        M[adj] = new Node(adj->val);
                        Q.push(adj);
                    }
                    M[node]->neighbors.push_back(M[adj]);
                }
            }
        }
        return result;
    }
};
/* End of Solution */
/*
 * Comment by ldcduc
 * Suggested tags: graph
 *
 * */