【LeetCode】#133克隆图(Clone Graph)

【LeetCode】#133克隆图(Clone Graph)

题目描述

克隆一张无向图，图中的每个节点包含一个 label （标签）和一个 neighbors （邻接点）列表 。
OJ的无向图序列化：
节点被唯一标记。
我们用 # 作为每个节点的分隔符，用 , 作为节点标签和邻接点的分隔符。

示例

例如，序列化无向图 {0,1,2#1,2#2,2}。
该图总共有三个节点, 被两个分隔符 # 分为三部分。
第一个节点的标签为 0，存在从节点 0 到节点 1 和节点 2 的两条边。
第二个节点的标签为 1，存在从节点 1 到节点 2 的一条边。
第三个节点的标签为 2，存在从节点 2 到节点 2 (本身) 的一条边，从而形成自环。
我们将图形可视化如下：

   1
  / \
 /   \
0 --- 2
     / \
     \_/

Description

Given the head of a graph, return a deep copy (clone) of the graph. Each node in the graph contains a label (int) and a list (List[UndirectedGraphNode]) of its neighbors. There is an edge between the given node and each of the nodes in its neighbors.
OJ’s undirected graph serialization (so you can understand error output):
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.

Example

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:

   1
  / \
 /   \
0 --- 2
     / \
     \_/

解法

public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if (node == null) {
            return node;
        }
        UndirectedGraphNode newRoot = new UndirectedGraphNode(node.label);
        Map<Integer, UndirectedGraphNode> done = new HashMap<>();
        done.put(node.label, newRoot);
        if(node.neighbors != null && !node.neighbors.isEmpty()) {
            process(newRoot, node.neighbors, done);
        }
        return newRoot;
    }
    
    private void process(UndirectedGraphNode node, List<UndirectedGraphNode> neighbors,  Map<Integer, UndirectedGraphNode> done) {
        for(UndirectedGraphNode neighbor : neighbors) {
            UndirectedGraphNode newNeighbor;
            if (!done.containsKey(neighbor.label)) {
                newNeighbor= new UndirectedGraphNode(neighbor.label);  
                done.put(newNeighbor.label, newNeighbor);
                if(neighbor.neighbors != null && !neighbor.neighbors.isEmpty()) {
                    process(newNeighbor, neighbor.neighbors, done);
                }
            } else {
                newNeighbor = done.get(neighbor.label);
            }
            node.neighbors.add(newNeighbor);
        }
    }
}