# 【LeetCode】310. Minimum Height Trees 解题报告（Python）

900 篇文章 145 订阅
1033 篇文章 48 订阅

id： fuxuemingzhu

## 题目描述

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 :

Input: n = 4, edges = [[1, 0], [1, 2], [1, 3]]

0
|
1
/ \
2   3

Output: [1]


Example 2 :

Input: n = 6, edges = [[0, 3], [1, 3], [2, 3], [4, 3], [5, 4]]

0  1  2
\ | /
3
|
4
|
5

Output: [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.

## 解题方法

### BFS

class Solution(object):
def findMinHeightTrees(self, n, edges):
"""
:type n: int
:type edges: List[List[int]]
:rtype: List[int]
"""
if n == 1: return [0]
leaves = collections.defaultdict(set)
for u, v in edges:
que = collections.deque()
for u, vs in leaves.items():
if len(vs) == 1:
que.append(u)
while n > 2:
_len = len(que)
n -= _len
for _ in range(_len):
u = que.popleft()
for v in leaves[u]:
leaves[v].remove(u)
if len(leaves[v]) == 1:
que.append(v)
return list(que)


## 参考资料

http://www.cnblogs.com/grandyang/p/5000291.html

## 日期

2018 年 10 月 30 日 —— 啊，十月过完了

11-06 354
09-18 643
10-27 754
03-27 415
03-31 271

### “相关推荐”对你有帮助么？

• 非常没帮助
• 没帮助
• 一般
• 有帮助
• 非常有帮助

¥2 ¥4 ¥6 ¥10 ¥20

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。