133. 克隆图

方法一：dfs

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> neighbors;

    Node() {}

    Node(int _val, vector<Node*> _neighbors) {
        val = _val;
        neighbors = _neighbors;
    }
};
*/
class Solution {
private:
    map<Node*,Node*> mp;  
public:
    Node* cloneGraph(Node* node) {
        if(node==NULL)
            return NULL;
        if(mp.count(node))
            return mp[node];
        Node* c=new Node(node->val);
        mp[node]=c;
        for(int i=0;i<node->neighbors.size();i++){
            if(node->neighbors[i])
                c->neighbors.push_back(cloneGraph(node->neighbors[i]));
        }
        return c;
    }
};