题目 解法 maxheap并且保持heap的长度,这样第一个元素永远都是答案 class KthLargest: def __init__(self, k: int, nums: List[int]): self.k = k self.nums = [] for num in nums: heapq.heappush(self