133-Clone Graph

最新推荐文章于 2021-07-14 09:59:19 发布

kevin聪

最新推荐文章于 2021-07-14 09:59:19 发布

阅读量450

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数据结构文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/80584887

算法与数据结构专栏收录该内容

569 篇文章

订阅专栏

本文介绍了一种通过深度优先搜索实现的无向图复制算法。该算法利用哈希映射来跟踪已复制的节点，确保每个节点仅被复制一次，并正确地建立新节点之间的连接。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

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:

问题描述

复制一个无向图。图里的每一个节点包含一个标签还有相邻节点列表

在线评测的无向图序列化:

每个节点的标签唯一

使用’#’分隔每个节点，使用’,’分隔节点标签以及相邻节点

举例来说，考虑{0, 1, 2#1, 2 # 2, 2}

这个有向图总共有3个节点，因此被’#’分隔后有3部分

第一个节点被标记为0.将其与1和2相连
第二个节点被标记为1.将其与2相连(注意没有0)
第三个节点被标记为2，将其与2相连，形成自环

有向图如下所示：

问题分析

遍历节点，创建新节点即可，注意用Map保存已经遇到过的节点

解法

public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        HashMap<Integer,UndirectedGraphNode> map = new HashMap();

        return dfs(node,map);
    }
    private UndirectedGraphNode dfs(UndirectedGraphNode node, HashMap<Integer,UndirectedGraphNode> map) {
        if(node == null) return null;
        if(map.containsKey(node.label)) return map.get(node.label);

        UndirectedGraphNode clone = new UndirectedGraphNode(node.label);
        map.put(node.label,clone);
        for(int i = 0; i < node.neighbors.size(); i++) clone.neighbors.add(dfs(node.neighbors.get(i), map));

        return clone;
    }
}