Last active
July 29, 2023 03:06
-
-
Save zlrlo/39169064d66b7ea344c2a2d3a30e9656 to your computer and use it in GitHub Desktop.
[JS] Max Heap 구현
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class MaxHeap { | |
| constructor() { | |
| this.heap = [null]; | |
| } | |
| push(value) { | |
| this.heap.push(value); | |
| let currentIndex = this.heap.length - 1; | |
| let parentIndex = Math.floor(currentIndex / 2); | |
| while (parentIndex !== 0 && this.heap[parentIndex] < value) { | |
| const temp = this.heap[parentIndex]; | |
| this.heap[parentIndex] = value; | |
| this.heap[currentIndex] = temp; | |
| currentIndex = parentIndex; | |
| parentIndex = Math.floor(currentIndex / 2); | |
| } | |
| } | |
| pop() { | |
| if (this.heap.length === 2) return this.heap.pop(); // 루트 정점만 남은 경우 | |
| const returnValue = this.heap[1]; | |
| this.heap[1] = this.heap.pop(); | |
| let currentIndex = 1; | |
| let leftIndex = 2; | |
| let rightIndex = 3; | |
| while (this.heap[currentIndex] < this.heap[leftIndex] || | |
| this.heap[currentIndex] < this.heap[rightIndex]) { | |
| if (this.heap[leftIndex] < this.heap[rightIndex]) { | |
| const temp = this.heap[currentIndex]; | |
| this.heap[currentIndex] = this.heap[rightIndex]; | |
| this.heap[rightIndex] = temp; | |
| currentIndex = rightIndex; | |
| } else { | |
| const temp = this.heap[currentIndex]; | |
| this.heap[currentIndex] = this.heap[leftIndex]; | |
| this.heap[leftIndex] = temp; | |
| currentIndex = leftIndex; | |
| } | |
| leftIndex = currentIndex * 2; | |
| rightIndex = currentIndex * 2 + 1; | |
| } | |
| return returnValue; | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment