[Swift]LeetCode310. 最小高度树 | Minimum Height Trees

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10260439.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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 :

n = 4
edges = [[1, 0], [1, 2], [1, 3]]
[1]

Example 2 :

n = 6
edges = [[0, 3], [1, 3], [2, 3], [4, 3], [5, 4]]
[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.

---

对于一个具有树特征的无向图，我们可选择任何一个节点作为根。图因此可以成为树，在所有可能的树中，具有最小高度的树被称为最小高度树。给出这样的一个图，写出一个函数找到所有的最小高度树并返回他们的根节点。

格式

该图包含 n 个节点，标记为 0 到 n - 1。给定数字 n 和一个无向边 edges 列表（每一个边都是一对标签）。

你可以假设没有重复的边会出现在 edges 中。由于所有的边都是无向边， [0, 1]和 [1, 0] 是相同的，因此不会同时出现在 edges 里。

示例 1:

n = 4
edges = [[1, 0], [1, 2], [1, 3]]
[1]

示例 2:

n = 6
edges = [[0, 3], [1, 3], [2, 3], [4, 3], [5, 4]]
[3, 4]

说明:

•  根据树的定义，树是一个无向图，其中任何两个顶点只通过一条路径连接。 换句话说，一个任何没有简单环路的连通图都是一棵树。
• 树的高度是指根节点和叶子节点之间最长向下路径上边的数量。

---

1724 ms

class Solution {
    func findMinHeightTrees(_ n: Int, _ edges: [[Int]]) -> [Int]{
        var graph = [Int : Set<Int>]()
        for edge in edges {
            if graph[edge[0]] == nil {
                graph[edge[0]] = [edge[1]]
            }else {
                graph[edge[0]]!.insert(edge[1])
            }
            if graph[edge[1]] == nil {
                graph[edge[1]] = [edge[0]]
            }else {
                graph[edge[1]]!.insert(edge[0])
            }
            
        }
        while graph.count > 2 {
            let list = graph.filter{$1.count == 1}
            for dict in list {
                graph[dict.value.first!]?.remove(dict.key)
                graph[dict.key] = nil
            }
        }
        
        let res = Array(graph.keys)
        if res.isEmpty {
            return [0]
        }
        return res
    }
}