关闭

【Leetcode】 Clone Graph

2381人阅读 评论(0) 收藏 举报
分类:

题目链接:https://leetcode.com/problems/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
         / \
         \_/

思路:

BFS/DFS ,因为标签唯一,所以用Map保存对应关系,这里用dfs递归拷贝新节点。

算法

Map<Integer, UndirectedGraphNode> sets = new HashMap<Integer, UndirectedGraphNode>();  
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {  
    if(node == null)  
        return null;  
    if(sets.containsKey(node.label))  
        return sets.get(node.label);  
      
    UndirectedGraphNode newNode = new UndirectedGraphNode(node.label);  
    sets.put(newNode.label, newNode);  
    for (UndirectedGraphNode neighbor : node.neighbors) {  
        newNode.neighbors.add(cloneGraph(neighbor));  
    }  
    return newNode;  
}  


1
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:545582次
    • 积分:8453
    • 等级:
    • 排名:第2645名
    • 原创:305篇
    • 转载:6篇
    • 译文:0篇
    • 评论:35条
    博客专栏
    文章分类
    最新评论