8 april 2023

/// 133. Clone Graph







/*
// 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:
    unordered_map<Node * , Node * > copies;
    Node* cloneGraph(Node* node) {  
        if(!node) return NULL;

        if(copies.find(node) == copies.end()){
            copies[node] = new Node (node -> val , {});
            for(Node * neighbor : node -> neighbors){
                copies[node] -> neighbors.push_back(cloneGraph(neighbor));
            }
        }

        return copies[node];
    }
};