树的最小高度 Minimum Height Trees

最新推荐文章于 2023-03-22 00:00:11 发布

weixin_34109408

最新推荐文章于 2023-03-22 00:00:11 发布

阅读量358

点赞数

文章标签： python

原文链接：https://my.oschina.net/liyurong/blog/1593177

版权

2019独角兽企业重金招聘Python工程师标准>>>

问题：

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]]

return [1]

Example 2:

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

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.

解决：

【题意】无向图中的任一节点都可以作为树的根节点，找到所有以某节点为根其高度最小的节点的集合。

① BFS。从叶子节点开始进行 BFS。所有入度（即相连边数）为 1 的节点即是叶子节点。找高度最小的节点，即找离所有叶子节点最远的节点，也即找最中心的节点。

找最中心的节点的思路很简单：每次去掉当前图的所有叶子节点，重复此操作直到只剩下最后的根。

class Solution { //55ms
public List<Integer> findMinHeightTrees(int n, int[][] edges) {
List<Integer> leaves = new ArrayList<>();
if (n == 0) return leaves;
if (n == 1){
leaves.add(0);
return leaves;
}
List<Set<Integer>> adjacent = new ArrayList<>(n);//用于保存相邻节点
for (int i = 0;i < n;i ++){//初始化
adjacent.add(new HashSet<>());
}
for (int[] edge : edges){//保存每个节点对应的相邻节点
adjacent.get(edge[0]).add(edge[1]);
adjacent.get(edge[1]).add(edge[0]);
}
for (int i = 0;i < n;i ++){
if (adjacent.get(i).size() == 1) leaves.add(i);//只有一个相邻节点的叶节点
}
while (n > 2){//一条链上最长有偶数个值时可能有中间两个节点，奇数个时可能有中间的一个节点
n -= leaves.size();//去除叶节点
List<Integer> newLeaves = new ArrayList<>();
for (int i : leaves){
int t = adjacent.get(i).iterator().next();//获取与当前叶节点相邻的节点
adjacent.get(t).remove(i);//删除相邻节点中的当前节点
if (adjacent.get(t).size() == 1) newLeaves.add(t);//判断相邻节点是否为叶节点
}
leaves = newLeaves;
}
return leaves;
}
}

② 使用数组保存边。

class Solution { //27ms
public List<Integer> findMinHeightTrees(int n, int[][] edges) {
int[] degrees = new int[n];//获取度
List[] adjacent = new ArrayList[n];//保存相邻节点
for (int i = 0;i < n;i ++){
adjacent[i] = new ArrayList();
}
for (int[] edge : edges){
adjacent[edge[0]].add(edge[1]);
adjacent[edge[1]].add(edge[0]);
degrees[edge[0]] ++;
degrees[edge[1]] ++;
}
Queue<Integer> queue = new LinkedList<>();//用于叶节点
for (int i = 0;i < n;i ++){
if (degrees[i] <= 1) queue.offer(i);
}
List<Integer> res = new ArrayList<>();
while(! queue.isEmpty()){
int size = queue.size();
res = new ArrayList<>();
for (int i = 0;i < size;i ++){
int node = queue.poll();
res.add(node);
List<Integer> tmp = adjacent[node];//获取当前节点的相邻节点
adjacent[node] = null;
if (tmp == null) continue;
for (int j = 0;j < tmp.size();j ++){
int next = tmp.get(j);
degrees[next] --;
if (degrees[next] == 1) queue.offer(next);
}
}
}
return res;
}
}