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

题目分析

挺有趣的一道题目，给出一个undirected的无环图，找到它最小树高度的结点集。一开始往DP方向去想，树的动态规划没怎么学过，只好放弃。另一种比较直接明了的办法就是BFS。

用BFS去寻找叶节点，慢慢将叶节点都去除，直到剩下的结点数连接数小于等于1，则将剩下的结点数返回。

源代码

class Solution {
public:
    vector<int> findMinHeightTrees(int n, vector<pair<int, int>>& edges) {
        vector<unordered_set<int> > adj(n);

        //建立邻接矩阵
        for (int i = 0; i < edges.size(); i++) {
            adj[edges[i].first].insert(edges[i].second);
            adj[edges[i].second].insert(edges[i].first);
        }


        vector<int> current;
        //
        if (n == 1)
            current.push_back(0);
        for (int i = 0; i < n; i++) {
            if (adj[i].size() == 1) {
                current.push_back(i);

            }
        }

        while (1) {
            vector<int> next;
            //找出叶节点
            for (int node : current) {
                for (int neighbor : adj[node]) {
                  adj[neighbor].erase(node);
                  if (adj[neighbor].size() == 1) next.push_back(neighbor);
                }
              }
            if (next.empty())   return current;
            current = next;
        }
    }
};