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

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

一开始解题思路就是错的，在判断是否有重复节点时没有想到可以用HashMap；因而总会重复遍历；看了别人的代码之后才恍然大悟，Java编程思想看了不用就是没用啊。。改正后代码如下：

<span style="font-family:Arial;font-size:14px;">public class Solution {
    public static int cycleCount = 0;
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        HashMap<Integer, UndirectedGraphNode> checker = new HashMap<Integer, UndirectedGraphNode>();
        return cloneGraph(node, checker);
    }
    
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node, HashMap<Integer, UndirectedGraphNode> checker){
        if(node == null)
            return null;
        if(checker.containsKey(node.label))
            return checker.get(node.label);
        UndirectedGraphNode newNode = new UndirectedGraphNode(node.label);
        checker.put(node.label, newNode);
        for(UndirectedGraphNode n : node.neighbors){
            newNode.neighbors.add(cloneGraph(n, checker));
        }
       return newNode; 
    }
}</span>