[leetcode]解决Clone Graph的一点小心得

本次选择的题目是

Clone 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 #.

First node is labeled as 0. Connect node 0 to both nodes 1 and 2. Second node is labeled as 1. Connect node 1 to node 2. 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
     / \
     \_/

Solution：
We know that the graph has two nodes 0 and 1 and they are connected to each other.

我们考虑graph {0, 1 # 1, 0}。我们知道这个graph中有两个互相连接的点，分别为0和1，现在我们从点0开始。我们复制点0，然后检查它的neighbors，发现点1。我们复制点1，现在graph为{0 (copy), 1 (copy)}。现在我们检查点1，复制点1，问题来了，我们为什么要做同样的复制呢（在点1上）？如果我们做一个新的复制关于1，图的结构就会发生错误。所以我们要维护一个mapping关于每一个原图的点和它的复制，时刻注意是否重复建立复制。

/**
 * 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) return NULL;
        if (mp.find(node) == mp.end()) {
            mp[node] = new UndirectedGraphNode(node -> label);
            for (UndirectedGraphNode* neigh : node -> neighbors)
                mp[node] -> neighbors.push_back(cloneGraph(neigh));
        }
        return mp[node];
    } 
private:
    unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> mp;
};