摘要： 手写最大堆-实现 1 class Heap { 2 public: 3 void push(int x){ 4 heap.push_back(x); 5 size += 1; 6 int now = size; 7 while(now!=1) { 8 int parent = now / 2; 9 阅读全文