leetcode: Clone Graph

lone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

OJ's undirected graph serialization:

Nodes are labeled uniquely.

We use  # as a separator for each node, and  , as a separator for node label and each neighbor of the node.

As an example, consider the serialized graph {0,1,2#1,2#2,2}.

The graph has a total of three nodes, and therefore contains three parts as separated by #.

1. First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
2. Second node is labeled as 1. Connect node 1 to node 2.
3. Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle.

Visually, the graph looks like the following:

       1
      / \
     /   \
    0 --- 2
         / \
         \_/

用unordered_map保存已复制的节点。

/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector<UndirectedGraphNode *> neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if( node == NULL)
            return NULL;
        unordered_map< int, UndirectedGraphNode *> mapping;
        return cloneNode( node, mapping);
    }
    UndirectedGraphNode *cloneNode( UndirectedGraphNode *node, unordered_map< int, UndirectedGraphNode *> &mapping){
        if( node == NULL)
            return NULL;
        if( mapping.count(node->label))
            return mapping[node->label];
        UndirectedGraphNode *new_node = new UndirectedGraphNode(node->label);
        mapping[new_node->label] = new_node;
        for( int i = 0; i < node->neighbors.size(); ++i){
            UndirectedGraphNode *tmp = cloneNode( node->neighbors[i], mapping);
            new_node->neighbors.push_back(tmp);
        }
        return new_node;
    }
};