题目

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:
       1/ \/   \0 --- 2/ \\_/

方法

主要分两步：第一步创建全部的结点。第二步，创建结点的neighbors

/*** 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<Integer, UndirectedGraphNode> map = new HashMap<Integer, UndirectedGraphNode>();Map<Integer, UndirectedGraphNode> graph = new HashMap<Integer, UndirectedGraphNode>();Queue<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();queue.offer(node);while(!queue.isEmpty()) {UndirectedGraphNode temp = queue.poll();if (!map.containsKey(temp.label)) {UndirectedGraphNode newTemp = new UndirectedGraphNode(temp.label);graph.put(temp.label, temp);map.put(temp.label, newTemp);}for (UndirectedGraphNode neighbor : temp.neighbors) {if (!map.containsKey(neighbor.label)) {queue.offer(neighbor);}}}for (int label : graph.keySet()) {UndirectedGraphNode temp = graph.get(label);UndirectedGraphNode cloneTemp = map.get(temp.label);for (UndirectedGraphNode neighbor : temp.neighbors) {cloneTemp.neighbors.add(map.get(neighbor.label));}}return map.get(node.label);}
}

Clone Graph相关推荐

133. Clone Graph
欢迎fork and star:Nowcoder-Repository-github 133. Clone Graph 题目 Clone an undirected graph. Each node ...
【重点！DFS/记忆化递归 + BFS】LeetCode 133. Clone Graph
LeetCode 133. Clone Graph Solution1: DFS/记忆化递归,参考网址:http://www.cnblogs.com/grandyang/p/4267628.html ...
[leetcod] Clone Graph
题目: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. ...
leetcode -- Clone Graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. [解题思 ...
Clone Graph问题及解法
问题描述: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors ...
LeetCode Clone Graph(搜索问题)
问题:给出一个邻接列表表示的图,要求克隆这个图思路: 1.深度优先搜索,使用map记录结点与其克隆结点之间的映射关系 .当遍历结点时,如果在map中存在结点的克隆,则直接返回.否则创建结点的克隆,加 ...
133. Clone Graph 克隆图
给你无向连通图中一个节点的引用,请你返回该图的深拷贝(克隆). 图中的每个节点都包含它的值 val(int) 和其邻居的列表(list[Node]). class Node {public in ...
【LeetCode】图论 graph（共20题）
[133]Clone Graph (2019年3月9日,复习) 给定一个图,返回它的深拷贝. 题解:dfs 或者 bfs 都可以 1 /* 2 // Definition for a Node. 3 ...
leetcode解题文件夹
点击打开链接点击打开链接点击打开链接參考文献:http://blog.csdn.net/lanxu_yy/article/details/17848219 只是本文准备用超链接的方式连接到对应解答页面 ...

Clone Graph

题目

方法

Clone Graph相关推荐

最新文章

热门文章