[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 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/ \\_/

题目分析：

题目本身就是个图的遍历问题，其实只用看最上面的一句就OK了。下面整这么一篇就是为了说明Testcase，结果误导对了我好久。

与树的遍历不同之处就是图可能会出现"闭合的环"这样会造成无线循环，所以遍历的时候需要把已经遍历过的点去掉。

根据题目，图中每一个点的权值是不一样的，所以可以采用取巧的方法检测这个点是否已经加在了图中，即使用HashMap

思路一：深度优先搜索

    public static UndirectedGraphNode cloneDFS(UndirectedGraphNode node,HashMap<Integer, UndirectedGraphNode> validator){if(validator.containsKey(node.label)){return validator.get(node.label);}UndirectedGraphNode nodeTemp = new UndirectedGraphNode(node.label);validator.put(node.label, nodeTemp);for(int i =0;i<node.neighbors.size();i++){nodeTemp.neighbors.add(cloneDFS(node.neighbors.get(i),validator));}return nodeTemp;}public static UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {if(node== null ||  node.equals(null)){return null;}HashMap<Integer, UndirectedGraphNode> validator = new HashMap<Integer, UndirectedGraphNode>();return cloneDFS(node, validator);}

思路二：广度优先搜索

XXX

转载于:https://www.cnblogs.com/savageclc26/p/4884900.html

[LeetCode]: 133: Clone Graph相关推荐

【重点！DFS/记忆化递归 + BFS】LeetCode 133. Clone Graph
LeetCode 133. Clone Graph Solution1: DFS/记忆化递归,参考网址:http://www.cnblogs.com/grandyang/p/4267628.html ...
133. Clone Graph
欢迎fork and star:Nowcoder-Repository-github 133. Clone Graph 题目 Clone an undirected graph. Each node ...
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 -- 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中存在结点的克隆,则直接返回.否则创建结点的克隆,加 ...
Clone Graph
题目 Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. O ...
leetcode 785. Is Graph Bipartite? | 785. 判断二分图（DFS，地图着色）
题目 https://leetcode.com/problems/is-graph-bipartite/ 题解有点像简化版的地图着色问题. 每走一步,颜色翻转一下,并且染色. 当遇到已经染过色的节点 ...
[leetcod] Clone Graph
题目: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. ...
Leetcode 133.克隆图
Time: 20190903 Type: Medium 题目描述给定无向连通图中一个节点的引用,返回该图的深拷贝(克隆).图中的每个节点都包含它的值 val(Int) 和其邻居的列表(list[No ...

[LeetCode]: 133: Clone Graph

[LeetCode]: 133: Clone Graph相关推荐

最新文章

热门文章