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.

能够构成树的图，其节点数比边多一


在无向图中首先检测所有的叶子节点(只有一个节点与该节点相连的节点，度为1),并删除所有叶子节点，在删除叶子节点时同时修改该节点的邻接点的度减一，
重复执行上面操作，直到剩下的节点数不大于2时即为所求。
方法类似于有向图的拓扑排序
采用一个队列来放叶子节点
*/


class Solution {
public:
    vector<int> findMinHeightTrees(int n, vector<pair<int, int>>& edges) {
        vector<vector<int> > neighbors(n); 
        vector<int> degrees(n,0);//存储节点的度
        for(auto node : edges){  //存储邻接点
            neighbors[node.first].push_back(node.second);
            neighbors[node.second].push_back(node.first);
            degrees[node.first]++;
            degrees[node.second]++;
        }
        queue<int> q; 
        for(int i=0;i<n;i++) //寻找叶子节点
            if(degrees[i]<=1) //叶子
                q.push(i);
        while(n>2){
            int leafs = q.size();
            n-=leafs;
            for(int i=0;i<leafs;i++){
                int tmp = q.front();
                q.pop();    //移除叶子
                for(auto neighbor : neighbors[tmp]){
                    degrees[neighbor]--;  //相邻的节点的度减一
                    if(degrees[neighbor]==1) //寻找新叶子
                        q.push(neighbor);
                }
            }
        }
        vector<int> res;
        while(!q.empty()){
            res.push_back(q.front());
            q.pop();
        }
        return res;
    }
};