10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T4bd,import java.util.*; class Solution { public List findMinHeightTrees(int n, int[][] edges) { if (n <= 2) { List res = new ArrayList<>(); for (int i = 0; i < n; i++) res.add(i); return res; } List> adj = new ArrayList<>(); for (int i = 0; i < n; i++) adj.add(new HashSet<>()); for (int[] edge : edges) { adj.get(edge[0]).add(edge[1]); adj.get(edge[1]).add(edge[0]); } List leaves = new ArrayList<>(); for (int i = 0; i < n; i++) { if (adj.get(i).size() == 1) leaves.add(i); } int remainingNodes = n; while (remainingNodes > 2) { remainingNodes -= leaves.size(); List newLeaves = new ArrayList<>(); for (int leaf : leaves) { int neighbor = adj.get(leaf).iterator().next(); adj.get(neighbor).remove(leaf); if (adj.get(neighbor).size() == 1) { newLeaves.add(neighbor); } } leaves = newLeaves; } return leaves; } }13:T46a,#include #include using namespace std; class Solution { public: vector findMinHeightTrees(int n, vector>& edges) { if (n <= 2) { vector res; for (int i = 0; i < n; ++i) res.push_back(i); return res; } vector> adj(n); for (auto& edge : edges) { adj[edge[0]].insert(edge[1]); adj[edge[1]].insert(edge[0]); } vector leaves; for (int i = 0; i < n; ++i) { if (adj[i].size() == 1) leaves.push_back(i); } int remainingNodes = n; while (remainingNodes > 2) { remainingNodes -= leaves.size(); vector newLeaves; for (int leaf : leaves) { int neighbor = *adj[leaf].begin(); adj[neighbor].erase(leaf); if (adj[neighbor].size() == 1) { newLeaves.push_back(neighbor); } } leaves = move(newLeaves); } return leaves; } };

Time Complexity

Space Complexity