【Leetcode】 Clone Graph

最新推荐文章于 2022-02-23 10:37:52 发布

wuezs

最新推荐文章于 2022-02-23 10:37:52 发布

阅读量2.5k

点赞数 1

分类专栏： leetcode Leetcode题解java版

本文链接：https://blog.csdn.net/yeqiuzs/article/details/51542415

版权

Leetcode题解java版同时被 2 个专栏收录

289 篇文章 362 订阅

订阅专栏

leetcode

283 篇文章 0 订阅

订阅专栏

本文介绍如何解决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 #.

First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
Second node is labeled as 1. Connect node 1 to node 2.
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:

思路：

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;  
}