【LeetCode】Clone_Graph

这也是LeetCode上的一道题目，描述如下：

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
    / \
   \_/

这其实不算很难的一道题目，加上之前做过Copy List with Random Pointer，方法很类似，但由于我C++使用还不太熟练，出现了一些问题，特此记录下：

1、思路很简单，即遍历所有节点，用map记录下遍历过的节点。与复制链表不同的一点是，遇到已经存在的节点不能简单地return，还是得把它添加进neighbors。

2、指针为空的问题。在cloneNode方法中，使用new初始化clone时，上一层的指针变量不会一起变化，导致断层，因此需要加上&使用引用传递。

3、将自定义类型的变量添加进vector时，需要将改动都操作完再push_back，否则已添加进vector的变量值不会改变。

struct UndirectedGraphNode {
    int label;
    vector<UndirectedGraphNode *> neighbors;
    UndirectedGraphNode(int x) : label(x) {};
};

class Solution {
public:
	UndirectedGraphNode *clonehead;
	unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> record;
	UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) 
	{
		if (!node)
			return clonehead;
		cloneNode(node, clonehead);
		return clonehead;
	}
	//2、clone指针需要使用引用传递，否则对clone进行new初始化以后，上层指针与初始化以后的clone将不是同个对象
	void cloneNode(UndirectedGraphNode *node, UndirectedGraphNode *&clone)
	{
		if (record.count(node))
			return;
		clone = new UndirectedGraphNode(node->label);
		record[node] = clone;
		if (node->neighbors.empty())
			return;
		for (int i = 0; i < node->neighbors.size(); i++)
		{
			//1、该处仍要执行push_back操作，但不需要继续向下递归
			if (record.count(node->neighbors[i]))
				clone->neighbors.push_back(record[node->neighbors[i]]);
			else
			{
				UndirectedGraphNode *temp;
				//3、必须先对temp操作完毕再执行push_back
				cloneNode(node->neighbors[i], temp);
				clone->neighbors.push_back(temp);
			}
		}
	}
};