class Solution {
public:
    Node* cloneGraph(Node* node) {
        unordered_map<Node*, Node*> m;
        return helper(node, m);
    }
    Node* helper(Node* node, unordered_map<Node*, Node*>& m) {
        if (!node) return NULL;
        if (m.count(node)) return m[node];
        Node *clone = new Node(node->val);
        m[node] = clone;
        for (Node *neighbor : node->neighbors) {
            clone->neighbors.push_back(helper(neighbor, m));
        }
        return clone;
    }
};

相关文章:

  • 2021-05-17
  • 2021-11-08
  • 2022-02-07
  • 2021-08-19
  • 2022-01-07
  • 2021-08-10
  • 2022-12-23
猜你喜欢
  • 2021-07-07
  • 2021-06-02
  • 2021-05-23
  • 2021-08-08
  • 2021-09-20
相关资源
相似解决方案