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 node0
to both nodes1
and2
. - Second node is labeled as
1
. Connect node1
to node2
. - Third node is labeled as
2
. Connect node2
to node2
(itself), thus forming a self-cycle.
Visually, the graph looks like the following:
1 / \ / \ 0 --- 2 / \
\_/
package leetCode; import java.util.*; /** * Created by lxw, liwei4939@126.com on 2018/3/26. */ class UndirectedGraphNode{ int label; List<UndirectedGraphNode> neighbors; public UndirectedGraphNode(int x){ label = x; neighbors = new ArrayList<>(); } } public class L133_CloneGraph { public UndirectedGraphNode cloneGraph(UndirectedGraphNode node){ if (node == null){ return null; } UndirectedGraphNode newNode = new UndirectedGraphNode(node.label); HashMap<Integer, UndirectedGraphNode> map = new HashMap<>(); map.put(newNode.label, newNode); Queue<UndirectedGraphNode> queue = new LinkedList<>(); queue.add(node); while (!queue.isEmpty()){ UndirectedGraphNode n = queue.poll(); for (UndirectedGraphNode neighbor : n.neighbors){ if (!map.containsKey(neighbor.label)){ map.put(neighbor.label, new UndirectedGraphNode(neighbor.label)); queue.add(neighbor); } map.get(n.label).neighbors.add(map.get(neighbor.label)); } } return newNode; } }