【Leetcode】 Clone Graph

本文介绍如何解决LeetCode上的克隆无向图问题,通过使用深度优先搜索(DFS)策略来实现图的复制。题目中每个节点包含一个唯一的标签,并有一系列相邻节点。解题思路是利用DFS递归地复制节点及其连接关系。
摘要由CSDN通过智能技术生成

题目链接: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
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值