风清扬

class CircleQueue{public: CircleQueue(int size = 20); ~CircleQueue(); CircleQueue(const CircleQueue &src); void operator =(const CircleQueue &src); void push(int val); void pop(); int...

class heap{public: heap(int *a = NULL, int n =0) :vc(a, a + n), _size(n) { ;//数组构造堆，下标从0开始 } void insert(int val)//插入到最堆的最后一个位置，并进行从下往上堆调整。 { vc.push_back(val); heapAdjust(0, vc.size());...

#include<iostream>#include<vector>#include<algorithm>using namespace std;/*利用STL堆算法实现的堆结构，优先级队列的底层就是大小堆*/class heap{public: heap(int *a = NULL, int n = 0) :vc(a, a + n), _s...