[LeetCode] 133. Clone Graph
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] 133. 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 node0
to both nodes1
and2
. - Second node is labeled as
1
. Connect node1
to node2
. - Third node is labeled as
2
. Connect node2
to node2
(itself), thus forming a self-cycle.
Visually, the graph looks like the following:
1 / / 0 --- 2 / \_/
/** * Definition for undirected graph. * class UndirectedGraphNode { * int label; * List<UndirectedGraphNode> neighbors; * UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); } * }; */ public class Solution { public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) { if (node == null) { return null; } Map<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<>(); Set<UndirectedGraphNode> visited = new HashSet<>(); Queue<UndirectedGraphNode> toBeVisited = new LinkedList<>(); toBeVisited.offer(node); while (!toBeVisited.isEmpty()) { UndirectedGraphNode current = toBeVisited.poll(); if (visited.contains(current)) { continue; } if (map.get(current) == null) { map.put(current, new UndirectedGraphNode(current.label)); } for (UndirectedGraphNode neighbor : current.neighbors) { if (map.get(neighbor) == null) { map.put(neighbor, new UndirectedGraphNode(neighbor.label)); } map.get(current).neighbors.add(map.get(neighbor)); toBeVisited.offer(neighbor); } visited.add(current); } return map.get(node); } }
以上是关于[LeetCode] 133. Clone Graph的主要内容,如果未能解决你的问题,请参考以下文章
leetcode 133. Clone Graph ----- java