310. Minimum Height Trees

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]

注意点：

• 最多也就两个MHT
• 所有叶子节点必然是结果集的叶子节点

 class Solution {
 public:
	 vector<int> findMinHeightTrees(int n, vector<pair<int, int>>& edges) {
		 vector<int> result;
		 map<int,set<int>> record;
		 for (int i=0;i<n;++i)
		 {
			 record.insert(make_pair(i,set<int>()));
		 }
		 for (auto p:edges)
		 {
			 record[p.first].insert(p.second);
			 record[p.second].insert(p.first);
		 }
		 vector<int> degree(n);
		 for (int i=0;i<n;++i)
		 {
			 degree[i] = record[i].size();              //degree record
		 }
		 int remain = n;
		 while (remain>2)
		 {
			 set<int> deleteNodes;
			 for (int i=0;i<n;++i)
			 {
				 if (degree[i]==1)                     //find the degree==1 node
				 {
					 remain--;
					 degree[i]=-1;
					 deleteNodes.insert(i);
				 }
			 }
			 for (int x:deleteNodes)                  //update the remain nodes degree
			 {
				 for (int y:record[x])
				 {
					 degree[y]--;
				 }
			 }
		 }
		 for (int i=0;i<n;++i)
		 {
			 if (degree[i]>=0)
			 {
				 result.push_back(i);
			 }
		 }
		 return result;
	 }
 };