LeetCode 310. Minimum Height Trees

分析

难度 中
来源 https://leetcode.com/problems/minimum-height-trees/

题目

For an 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:
• 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.”
• The height of a rooted tree is the number of edges on the longest downward path between the root and a leaf.

解答

Runtime: 23 ms, faster than 74.37% of Java online submissions for Minimum Height Trees.
Memory Usage: 49.5 MB, less than 55.14% of Java online submissions for Minimum Height Trees.
package LeetCode;

import java.util.*;

public class L310_MinumumHeightTrees {
    public List<Integer> findMinHeightTrees(int n, int[][] edges) {
        if(n<2)
            return Collections.singletonList(0);//创建单个元素的List，最简单的方法，可以在其中创建不可变List的单个元素。也可以使用Arrays.asList创建，但创建的列表不是不可变的
        List<Set<Integer>> nodeEdges=new ArrayList<>(n);//每个节点的连接的有哪些节点。
        for(int i=0;i<n;i++)
            nodeEdges.add(new HashSet<Integer>());
        for(int i=0;i<edges.length;i++){
            nodeEdges.get(edges[i][0]).add(edges[i][1]);
            nodeEdges.get(edges[i][1]).add(edges[i][0]);
        }
        List<Integer> leaves=new ArrayList<Integer>();
        for(int i=0;i<n;i++){//获取初始叶子节点集合。
            if (nodeEdges.get(i).size()==1)
                leaves.add(i);
        }
        while(n>2){
            n-=leaves.size();
            List<Integer> newLeaves=new ArrayList<>();
            for(int i:leaves){
                int j=nodeEdges.get(i).iterator().next();//获取连接到叶子的节点。
                nodeEdges.get(j).remove(i);//移除对应节点的连接记录。
                if(nodeEdges.get(j).size()==1)
                    newLeaves.add(j);//下一轮循环中成为叶子节点
            }
            leaves=newLeaves;
        }
        return leaves;
    }

    public static void main(String[] args){
        L310_MinumumHeightTrees l310=new L310_MinumumHeightTrees();
        int n=4;
        int[][] edges={{1,0}, {1, 2},{1,3}};
        System.out.println(l310.findMinHeightTrees(n,edges));
    }
}