Clone Graph (Java)

21 篇文章 0 订阅
6 篇文章 0 订阅

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辅助保存克隆关系。 这次只写了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的复制品,然后建立复制品之间的关系
		}
	}
}





  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值