Leetcode 310. Minimum Height Trees
来源:互联网 发布:淘宝家具品牌 编辑:程序博客网 时间:2024/04/30 14:57
310. Minimum Height Trees
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs). Given such a graph, write a function to find all the MHTs and return a list of their root labels.
Format
The graph contains n
nodes which are labeled from 0
to n - 1
. You will be given the number n
and a list of undirected edges
(each edge is a pair of labels).
You can assume that no duplicate edges will appear in edges
. Since all edges are undirected, [0, 1]
is the same as [1, 0]
and thus will not appear together in edges
.
Example 1:
Given n = 4
, edges = [[1, 0], [1, 2], [1, 3]]
0 | 1 / \ 2 3
return [1]
Example 2:
Given n = 6
, edges = [[0, 3], [1, 3], [2, 3], [4, 3], [5, 4]]
0 1 2 \ | / 3 | 4 | 5
return [3, 4]
Analysis: this question is to examine the understanding about the graph: The minimum depth of the tree means the most central one in the whole graph. So just delete the outer nodes from the graph, and at the last there would be some nodes that in the center
Here is the method to solve the graph http://www.cnblogs.com/grandyang/p/5000291.html
- Leetcode 310. Minimum Height Trees
- [leetcode] 310. Minimum Height Trees
- 310. Minimum Height Trees LeetCode
- leetcode 310. Minimum Height Trees
- LeetCode *** 310. Minimum Height Trees
- 【LeetCode】310. Minimum Height Trees
- [leetcode] 310.Minimum Height Trees
- leetcode-310. Minimum Height Trees
- [leetcode] 310. Minimum Height Trees
- 【LeetCode】310. Minimum Height Trees
- LeetCode 310. Minimum Height Trees
- Leetcode 310. Minimum Height Trees
- [LeetCode]310. Minimum Height Trees
- Leetcode: 310.Minimum Height Trees
- 【Leetcode】310. Minimum Height Trees
- LeetCode 310. Minimum Height Trees
- leetcode-310. Minimum Height Trees
- Leetcode 310. Minimum Height Trees
- Java与C++的编程差异
- MySQL索引背后的数据结构及算法原理
- webdriver与浏览器_操作页面元素—弹出窗口
- LeetCode 101 Symmetric Tree(对称树)(*)
- 大数据是让人幸福的科学
- Leetcode 310. Minimum Height Trees
- 227,使用GCD异步下载图片,更新UI
- UITextView时,点击键盘的Return,释放TextView第一响应者
- Android 判断应用处于前后台
- NSLayoutConstraint
- Objective-C你了解吗--如何编写高质量有效的OC代码
- 头文件的角色
- linux整理笔记:root用户上传的文件,其他用户无法覆盖和删除
- PHP 类属性 类静态变量的访问