from heapq import heappush, heappop #优先队列 class Solution: def findClosestElements(self, root: TreeNode, target: float, m: int) -> List[int]: # write code here heap, nodes = [], [root] while nodes: nodes, temps = [], nodes for node in temps: if len(heap) < m: heappush(heap, (-abs(node.val - tar...
