Leetcode Clone Graph
来源:互联网 发布:mac safari 缓存路径 编辑:程序博客网 时间:2024/06/05 12:08
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 / \ \_/
Difficulty: Medium
Solution: HashMap
/** * Definition for undirected graph. * class UndirectedGraphNode { * int label; * List<UndirectedGraphNode> neighbors; * UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); } * }; */public class Solution { HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<UndirectedGraphNode, UndirectedGraphNode>(); public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) { if(node == null) return null; if(!map.containsKey(node)){ UndirectedGraphNode newNode = new UndirectedGraphNode(node.label); map.put(node, newNode); for(int i = 0; i < node.neighbors.size(); i++){ newNode.neighbors.add(cloneGraph(node.neighbors.get(i))); } return newNode; } else{ return map.get(node); } }}
0 0
- LeetCode[Graph]: Clone Graph
- [LeetCode] CLone Graph
- LeetCode:Clone Graph
- [leetcode]Clone Graph
- Leetcode: Clone Graph
- [LeetCode] Clone Graph
- LeetCode题解:Clone Graph
- [LeetCode]Clone Graph
- leetcode Clone Graph
- leetcode-Clone Graph
- LeetCode | Clone Graph
- Leetcode: Clone Graph
- [LeetCode] Clone Graph
- LeetCode OJ:Clone Graph
- Leetcode Clone Graph
- [Leetcode] Clone Graph (Java)
- Clone Graph - LeetCode
- 【leetcode】Clone Graph
- 蓝桥杯 ADV-104算法提高 打水问题
- fwrite与xxd这对黄金搭档帮我定位出乱码问题------无法打印日志时如何打日志?
- LeetCode--No.102--Binary Tree Level Order Traversal
- Android登陆背景移动渐变
- HttpSession对象
- Leetcode Clone Graph
- 蓝桥杯 ADV-83算法提高 寻找三位数
- JSP定义和四大范围
- openGL的初步入门
- 关于坐标系转换与点在坐标系之间的转换
- 【最短路径】:Dijkstra算法、SPFA算法、Bellman-Ford算法和Floyd-Warshall算法
- Poj3468 A Simple Problem with Integers 线段树、区间更新
- Codeforces Good Bye 2015 A. New Year and Days
- 管理信息系统的技术观和经营观