LeetCode310. 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.

本文主要参看文章：here。原理用一个形象的解释就是剥洋葱，一层一层往里面剥，最后剩下的就是中心的了。

class Solution {
public:
    vector<int> findMinHeightTrees(int n, vector<vector<int>>& edges) {
        if(n == 1) return {0};
		vector<set<int>> adj(n);
		for (auto edge : edges) {
			adj[edge[0]].insert(edge[1]);
			adj[edge[1]].insert(edge[0]);
		}
		stack<int> leafs;
		for (int i = 0; i < n; i++)
			if (adj[i].size() == 1) leafs.push(i);

		while (n > 2) {
			n -= leafs.size();
			stack<int> tmp;
			while (!leafs.empty()) {
				int leaf = leafs.top(); leafs.pop();
				adj[*(adj[leaf].begin())].erase(leaf);
				if (adj[*(adj[leaf].begin())].size() == 1) tmp.push(*(adj[leaf].begin()));
			}
			leafs = tmp;
		}
		vector<int> res;
		while (!leafs.empty()) {
			res.push_back(leafs.top());
			leafs.pop();
		}
		return res;
    }
};