703.md

Kth Largest Element in a Stream

Description

link

---

Solution : HEAP

• See Code

---

Code

Complexity T : O( klog(n) )

class KthLargest:

    def __init__(self, k: int, nums: List[int]):
        self.k = k
        self.arr = nums
        heapq.heapify(self.arr)
        while len(self.arr) > k:
            heapq.heappop(self.arr)

    def add(self, val: int) -> int:
        if len(self.arr) < self.k:
            heapq.heappush(self.arr, val)
        else:
            heapq.heappushpop(self.arr, val)
        return self.arr[0]