310. Minimum Height Trees

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.

求使得树的高度最小的节点。

思路一：

通过BFS遍历图，分别以0~n-1为出发点，取得对应的图的最远距离集height[n]，在求height[n]中最小值对应的节点值即可，程序如下所示，但这种做法会TimeOut。

class Solution {
    public List<Integer> findMinHeightTrees(int n, int[][] edges) {
        List<Integer> list = new ArrayList<>();
        int[][] graph = new int[n][n];
        for (int i = 0; i < edges.length; ++ i){
            graph[edges[i][0]][edges[i][1]] = 1;
            graph[edges[i][1]][edges[i][0]] = 1;
        }
        int[] height = new int[n];
        int minHeight = Integer.MAX_VALUE;
        for (int i = 0; i < n; ++ i){
            height[i] = bfs(i, graph);
            minHeight = Math.min(minHeight, height[i]);
        }
        for (int i = 0; i < n; ++ i){
            if (height[i] == minHeight){
                list.add(i);
            }
        }
        return list;
    }
    
    public int bfs(int begin, int[][] graph){
        int n = graph.length;
        int[] visited = new int[n];
        int[] depth = new int[n];
        Arrays.fill(depth, Integer.MAX_VALUE);
        depth[begin] = 0;
        ArrayDeque<Integer> que = new ArrayDeque<>();
        que.offer(begin);
        boolean isTag = false;
        int minDepth = Integer.MIN_VALUE;
        while (!que.isEmpty()){
            int size = que.size();
            isTag = false;
            for (int i = 0; i < size; ++ i){
                int current = que.poll();
                visited[current] = 1;
                for (int j = 0; j < n; ++ j){
                    if (graph[current][j] == 1){
                        depth[j] = Math.min(depth[j], depth[current] + 1);
                        if (visited[j] == 0){
                            isTag = true;
                            que.offer(j);
                        }
                    }
                }
                if (!isTag){
                    minDepth = Math.max(minDepth, depth[current]);
                }
            }
        }
        return minDepth;
    }
}

思路2：

以图中任意一点，设为u，BFS遍历图，找到距离u处最远的点v，再以v为起点BFS遍历图，找到距离v最远的w点，并将v~w的路径保存下来，如果v~w节点数为基数，则中间节点即为所求，如果总结点数为偶数，则为中间相邻两个节点，但还是会TimeOut，有个用例过不了，程序如下所示：

class Solution {
    public List<Integer> findMinHeightTrees(int n, int[][] edges) {
        List<Integer> list = new ArrayList<>();
        int[][] graph = new int[n][n];
        List<Integer>[] adj = new List[n];
        for (int i = 0; i < n; ++ i){
            adj[i] = new ArrayList<>();
        }
        for (int[] pair : edges) {
            int u = pair[0];
            int v = pair[1];
            adj[u].add(v);
            adj[v].add(u);
        }
        int[] depth = new int[n];
        int[] path = new int[n];
        int maxHeight = 0;
        bfs(0, adj, depth, path);
        for (int i = 0; i < n; ++ i){
            if (depth[i] > depth[maxHeight]){
                maxHeight = i;
            }
        }
        bfs(maxHeight, adj, depth, path);
        maxHeight = 0;
        for (int i = 0; i < n; ++ i){
            if (depth[i] > depth[maxHeight]){
                maxHeight = i;
            }
        }
        while (path[maxHeight] != -1){
            list.add(maxHeight);
            maxHeight = path[maxHeight];
        }
        list.add(maxHeight);
        if (list.size() % 2 == 1) return Arrays.asList(list.get(list.size() / 2));
        else return Arrays.asList(list.get(list.size() / 2 - 1), list.get(list.size() / 2));
    }
    
    public void bfs(int begin, List<Integer>[] graph, int[] depth, int[] path){
        int n = depth.length;
        boolean[] visited = new boolean[n];
        visited[begin] = true;
        depth[begin] = 0;
        path[begin] = -1;
        Queue<Integer> que = new ArrayDeque<>();
        que.offer(begin);
        while (!que.isEmpty()){
            int current = que.poll();
            for (int v : graph[current]){
                if (!visited[v]){
                    visited[v] = true;
                    depth[v] = depth[current] + 1;
                    path[v] = current;
                    que.offer(v);
                }
            }
        }
    }
}

思路3：

可AC方法，参考网友算法（点击打开链接），去除叶子节点，程序如下所示：

class Solution {
    public List<Integer> findMinHeightTrees(int n, int[][] edges) {
        if (n == 0) return new ArrayList<>();
        else if (n == 1) {
            List<Integer> ret = new ArrayList<>();
            ret.add(0);
            return ret;
        }
        List<Integer>[] lists = new ArrayList[n];
        for (int i = 0; i < n; i++) {
            lists[i] = new ArrayList<>();
        }
        for (int i = 0; i < edges.length; i++) {
            int v1 = edges[i][0];
            int v2 = edges[i][1];
            lists[v1].add(v2);
            lists[v2].add(v1);
        }
        List<Integer> leaves = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            if (lists[i].size() == 1) {
                leaves.add(i);
            }
        }
        int count = n;
        while (count > 2) {
            int size = leaves.size();
            count -= size;
            List<Integer> newLeaves = new ArrayList<>();
            for (int i = 0; i < size; i++) {
                int leaf = leaves.get(i);
                for (int j = 0; j < lists[leaf].size(); j++) {
                    int toRemove = lists[leaf].get(j);
                    lists[toRemove].remove(Integer.valueOf(leaf));
                    if (lists[toRemove].size() == 1)
                        newLeaves.add(toRemove);
                }
            }
            leaves = newLeaves;
        }
        return leaves;
    }
}