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 / \ \_/
树的遍历,用hashmap辅助保存克隆关系。 这次只写了DFS,注意下次写的时候用上非递归DFS和BFS。
hashmap用key做原版,value做复制版。 同时注意复制版的neighbor也要连起来。
Source
/**
* 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;
HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
UndirectedGraphNode a = new UndirectedGraphNode(node.label);
map.put(node, a); //key存原始node,value存复制的a
dfs(node, map);
return a;
}
public void dfs(UndirectedGraphNode node, HashMap<UndirectedGraphNode, UndirectedGraphNode> map){
if(node == null)
return ;
for(int i = 0; i < node.neighbors.size(); i++){
UndirectedGraphNode temp = node.neighbors.get(i);
if(!map.containsKey(temp)){ //***
UndirectedGraphNode a = new UndirectedGraphNode(temp.label);
map.put(temp, a);
dfs(node.neighbors.get(i), map);
}
map.get(node).neighbors.add(map.get(temp)); //map.get(node)取出node对应的复制品,add后面不能用a,因为不一定执行了if,所以用map.get(temp),得到temp的复制品,然后建立复制品之间的关系
}
}
}