예제 #1
0
 public KthLargest()
 {
     Heap = new MinHeap <T>();
 }
예제 #2
0
 public MedianFinder()
 {
     largerElementMinHeap = new MinHeap <int>();
     smallerElemenMaxHeap = new MaxHeap <int>();
 }
예제 #3
0
 public KwayMerge()
 {
     Heap = new MinHeap <ListNode>();
 }