목록239. Sliding Window Maximum (1)

Scribbling

LeetCode: 239. Sliding Window Maximum

가장 먼저 떠오른 방법은 Priority Queue를 사용하는 것. Time Complexity: O(N*logN) import heapq class PriorityQueue: def __init__(self): self.pq = [] self.removals = [] def insert(self, elem): heapq.heappush(self.pq, -elem) def gettop(self): return -self.pq[0] def remove(self, elem): if elem == -self.pq[0]: heapq.heappop(self.pq) while self.removals and self.pq[0] == self.removals[0]: heapq.heappop(self.pq) heapq..
Computer Science/Coding Test 2021. 12. 23. 09:34
이전 Prev 1 Next 다음