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.
基本思路:
无向无循环的连通图,所构成的树。选择一个结束作为根,使得树的高度为最小。
连通图中,任意2点都有距离。距离最长的的2个点之间的中间点,作为根,可使树的高度为最小。
叶子的度为1,中间的点度> 1。 逐层去掉叶子结点,则最后剩余的结点即为根。
注意,根的可能性为1个或者2个。取决于最长距离上,结点的个数为奇数或者偶数。
class Solution {
public:
vector<int> findMinHeightTrees(int n, vector<pair<int, int>>& edges) {
if (n == 1)
return vector<int>(1);
vector<int> degree(n);
vector<vector<int> > adj(n);
for (auto e: edges) {
++degree[e.first];
++degree[e.second];
adj[e.first].push_back(e.second);
adj[e.second].push_back(e.first);
}
list<int> leafs;
for (size_t i = 0; i < degree.size(); i++) {
if (degree[i] == 1)
leafs.push_back(i);
}
while (n > 2) {
size_t leaf_size = leafs.size();
n -= leaf_size;
for (size_t i = 0; i < leaf_size; i++) {
const int leaf = leafs.front();
leafs.pop_front();
for (auto i: adj[leaf]) {
if (--degree[i] == 1)
leafs.push_back(i);
}
}
}
return vector<int>(leafs.begin(), leafs.end());
}
};