133.Clone Graph:典型的なDFS

/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    unordered_map ht;
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(!node) return NULL;
        if(ht.find(node) == ht.end()){
            ht[node] = new UndirectedGraphNode(node->label);
            for(auto it : node->neighbors){
                (ht[node]->neighbors).push_back(cloneGraph(it));
            }
                
        }
        return ht[node];
        
    }
};