310. Minimum Height Trees
package LeetCode_310 import java.util.* import kotlin.collections.ArrayList /** * 310. Minimum Height Trees * https://leetcode.com/problems/minimum-height-trees/description/ * */ class Solution { fun findMinHeightTrees(n_: Int, edges: Array<IntArray>): List<Int> { var n = n_ val result = ArrayList<Int>() if (n == 0) { return result } if (n == 1) { result.add(0) return result } //init and create graph val graph = ArrayList<ArrayList<Int>>() for (i in 0 until n) { graph.add(ArrayList()) } for (edge in edges) { graph.get(edge[0]).add(edge[1]) graph.get(edge[1]).add(edge[0]) } val queue = LinkedList<Int>() for (i in 0 until n) { //add leaf node into queue if (graph.get(i).size == 1) { queue.offer(i) } } //reduce level while (n > 2) { val size = queue.size n -= size for (i in 0 until size) { val leafNode = queue.poll()//get the leaf node for (node in graph[leafNode]) {//find out leaf node's connect node graph.get(node).remove(leafNode)//remove the node's connection if (graph.get(node).size == 1) { queue.offer(node) } } } } while (queue.isNotEmpty()) { result.add(queue.poll()) } return result } }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· .NET10 - 预览版1新功能体验(一)