자료구조
-
[python] minheap 구현하기자료구조 2022. 7. 3. 22:38
class MinHeap: def __init__(self): self.queue = [None] def insert(self, num): self.queue.append(num) lastElementIdx = len(self.queue) - 1 parentIdx = lastElementIdx // 2 while (parentIdx >= 1 and self.queue[lastElementIdx] < self.queue[parentIdx]): self.queue[parentIdx], self.queue[lastElementIdx] = self.queue[lastElementIdx], self.queue[parentIdx] lastElementIdx = parentIdx parentIdx = parentId..