133. Clone Graph
来源:互联网 发布:汉寿用友软件代理商 编辑:程序博客网 时间:2024/05/22 08:04
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 / \ \_/
Subscribe to see which companies asked this question
/** * 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; HashMap<Integer,UndirectedGraphNode> checker = new HashMap<>(); return clone(node,checker); } private UndirectedGraphNode clone(UndirectedGraphNode node,HashMap<Integer,UndirectedGraphNode> checker){ if(checker.containsKey(node.label)){ return checker.get(node.label); } UndirectedGraphNode newNode = new UndirectedGraphNode(node.label); checker.put(node.label,newNode); // newNode.neighbors = new ArrayList<UndirectedGraphNode>(node.neighbors); for(UndirectedGraphNode temNode:node.neighbors){ newNode.neighbors.add(clone(temNode, checker)); } return newNode; }}
0 0
- LeetCode 133. Clone Graph
- [Leetcode] 133. Clone Graph
- [leetcode] 133.Clone Graph
- 133. Clone Graph
- Leetcode 133. Clone Graph
- 133. Clone Graph LeetCode
- 133. Clone Graph
- LeetCode 133. Clone Graph
- leetcode 133. Clone Graph
- 133. Clone Graph
- 133. Clone Graph
- LeetCode *** 133. Clone Graph
- leetcode-133. Clone Graph
- LeetCode 133. Clone Graph
- 133. Clone Graph
- 133. Clone Graph
- 133. Clone Graph
- 133. Clone Graph
- Android入门——Activity生命周期和横竖屏切换和解屏总结
- 删除字符串的最后一个字符
- 系统调试工具总结
- Python 数据结构与算法——引用计数
- docker:dial unix /var/run/docker.sock: permission denied.
- 133. Clone Graph
- Python 获取对象信息
- pip在不同平台下的安装
- 微服务实战(一):微服务架构的优势与不足
- JS在线检测,cookie,子cookie
- tomcat查看实时日志
- Android程序间的跳转问题
- 计算机数据的存储单位
- 187. Repeated DNA Sequences