310. Minimum Height Trees
来源:互联网 发布:淘宝判定为广告的评价 编辑:程序博客网 时间:2024/06/05 16:42
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]
Note:
(1) According to the definition of tree on Wikipedia: “a tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.”
(2) The height of a rooted tree is the number of edges on the longest downward path between the root and a leaf.
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- 310. Minimum Height Trees
- FFmpeg工具介绍
- 梅特勒杯创新大赛(五):自定义ImageView-手控标记点
- Div+CSS 布局大全
- 210. Course Schedule II
- 617. Merge Two Binary Trees
- 310. Minimum Height Trees
- 513. Find Bottom Left Tree Value 树 BFS
- 19. Remove Nth Node From End of List
- 浅析JVM类加载机制
- 515. Find Largest Value in Each Tree Row 找到数每一层的最大值
- C++动态分配内存空间 : new 和 delete
- 576. Out of Boundary Paths
- 638. Shopping Offers 深度优先遍历、递归、存储技术(基于递归的动态规划)
- oracle触发器分类