LeetCode题解之Clone Graph

1、题目描述

2、问题分析

要遍历图，然后标记没有被复制的节点。

3、代码

class Solution {

private:
    unordered_map<Node*, Node*> m;

public:
    Node* cloneGraph(Node* node) {
        if (node == NULL)
            return NULL;
        
        Node *copy = new Node(node->val, {});
        queue<Node*> q;
        m[node] = copy;
        q.push(node);
        
        while (!q.empty()) {
            Node *cur = q.front();
            q.pop();
            
            for(Node* neighbor : cur->neighbors) {
                if (m.find(neighbor) == m.end()) {
                   m[neighbor] = new Node(neighbor->val, {});
                    q.push(neighbor);
                }
                m[cur]->neighbors.push_back(m[neighbor]);
                
            }
        }
        return copy;
    }
};