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

\_/

分析：用BFS和DFS实现都可以，BFS用FIFO队列存储点实现，DFS用栈存储点。用HashMap存储复制后的点加访问标记。

/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     List<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */
public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if (node == null) {
            return null;
        }
        
        Map<Integer, UndirectedGraphNode> map = new HashMap<Integer, UndirectedGraphNode>();
        Queue<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
        
        queue.offer(node);
        
        //FIFO, BFS
        while (!queue.isEmpty()) {
            UndirectedGraphNode curNode = queue.poll();
            if (!map.containsKey(curNode.label)) {
                map.put(curNode.label, new UndirectedGraphNode(curNode.label));
            }
            
            if (curNode.neighbors != null && curNode.neighbors.size() > 0) {
                UndirectedGraphNode curCloneNode = map.get(curNode.label);
    
                for (UndirectedGraphNode neighbor : curNode.neighbors) {
                    
                    if (!map.containsKey(neighbor.label)) {
                        queue.offer(neighbor);
                        map.put(neighbor.label, new UndirectedGraphNode(neighbor.label));
                    }
                    curCloneNode.neighbors.add(map.get(neighbor.label));
                }
            }
            
        }
        
        return map.get(node.label);
    }
}