/***********优先队列的(单向)链式实现形式*************/
节点类
template
class QueueNode
{
public:
Type data;//数据
int priority;//优先级
QueueNode *next;
QueueNode() :data(Type()), priority(0), next(nullptr){}
QueueNode(Type d, int p, QueueNode *n=nullptr) :data(d), priority(p), next(n){}
};
//优先队列类
template
class Priority_Queue
{
private:
QueueNode *front;//队头指针
QueueNode *rear;//队尾指针
int length;//队列长度
public:
Priority_Queue();
~Priority_Queue();
bool isEmpty(){ return this->length == 0; }
int size() const { return this->length; }
bool Push(const Type &d, int p);
bool Pop();
Type GetHead();
void ShowQueue() const;
};
//构造函数
template
Priority_Queue::Priority_Queue() :length(0)
{
cout << “构造函数,创建一个节点” << endl;
this->front = this->rear = new QueueNode();
}
//析构函数
template
Priority_Queue::~Priority_Queue()
{
cout << “析构函数” << endl;
QueueNode *dnode = this->front;
QueueNode *tmp = this->front;
while (tmp != nullptr)
{
tmp = tmp->next;
delete dnode;
dnode = tmp;
}
}
//添加节点
template
bool Priority_Queue::Push(const Type &d, int p)
{
QueueNode *add = new QueueNode(d, p, nullptr);//将要插入的节点
if (add == nullptr)
return false;
//要根据优先级构造队列,数字越小优先级越高应该, 数字最小的应该放在最前面