Leetcode 133. Clone Graph

原题：

Clone an undirected graph. Each node in the graph contains a label and a list of itsneighbors.

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 node0 to both nodes 1 and2.
2. Second node is labeled as 1. Connect node1 to node 2.
3. Third node is labeled as 2. Connect node2 to node 2 (itself), thus forming a self-cycle.

Visually, the graph looks like the following:

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

---

解决方法：

用类似于BFS的方法：

- 用一个hash表来保存旧节点和新节点之间的对应，

- 用一个queue来保存那些需要给neighbors赋值的节点。

代码：

UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if (!node)
            return NULL;
        unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> m;        
        UndirectedGraphNode* newNode = new UndirectedGraphNode(node->label);
        m[node] = newNode;
        
        queue<UndirectedGraphNode*> q;
        q.push(node);
        
        while(!q.empty()){
            UndirectedGraphNode* cur = q.front();
            q.pop();       
            for(auto n: cur->neighbors){
                if (!m.count(n)){
                    UndirectedGraphNode* newNode = new UndirectedGraphNode(n->label);
                    m[n] = newNode;
                    q.push(n);
                }
                m[cur]->neighbors.push_back(m[n]);
            }
        }
        
        return m[node];
    }