#include <iostream>
using namespace std;
typedef int elemtype;
struct QueueNode
{
elemtype data;
QueueNode *next;
};
class LinkQueue
{
public:
LinkQueue();
~LinkQueue();
void EnQueue(elemtype x);
elemtype DeQueue();
elemtype GetQueue();
QueueNode *front, *rear;
};
LinkQueue::LinkQueue()
{
front=new QueueNode;
front->next=NULL;
rear=front;
}
void LinkQueue::EnQueue(elemtype x)
{
QueueNode *s=new QueueNode; //申请一个数据域为x的结点s
s->data=x;
s->next=NULL; //将结点s插入到队尾
rear->next=s;
rear=s;
}
elemtype LinkQueue::DeQueue()
{
if (rear==front) throw "下溢";
QueueNode *p=front->next;
elemtype x=p->data; //暂存队头元素
front->next=p->next; //将队头元素所在结点摘链
if(p->next==NULL) rear=front; //判断出队前队列长度是否为1
delete p;
return x;
}
elemtype LinkQueue::GetQueue()
{
if (rear==front) throw "下溢";
return front->next->data;
}
bool LinkQueue::isEmpty()
{
if (rear==front)
{
return true;
}else return false;
{
while(front!=NULL)
{
QueueNode * tmp=front;
front=front->next;
delete tmp;
}
cout<<"链队列已销毁"<<endl;
}
void main()
{
LinkQueue lq;
lq.EnQueue(2);
lq.EnQueue(3);
cout<<lq.DeQueue();
}
using namespace std;
typedef int elemtype;
struct QueueNode
{
elemtype data;
QueueNode *next;
};
class LinkQueue
{
public:
LinkQueue();
~LinkQueue();
void EnQueue(elemtype x);
elemtype DeQueue();
elemtype GetQueue();
bool isEmpty();
int GetQueueLength();// 求队列的长度
QueueNode *front, *rear;
};
LinkQueue::LinkQueue()
{
front=new QueueNode;
front->next=NULL;
rear=front;
}
void LinkQueue::EnQueue(elemtype x)
{
QueueNode *s=new QueueNode; //申请一个数据域为x的结点s
s->data=x;
s->next=NULL; //将结点s插入到队尾
rear->next=s;
rear=s;
}
elemtype LinkQueue::DeQueue()
{
if (rear==front) throw "下溢";
QueueNode *p=front->next;
elemtype x=p->data; //暂存队头元素
front->next=p->next; //将队头元素所在结点摘链
if(p->next==NULL) rear=front; //判断出队前队列长度是否为1
delete p;
return x;
}
elemtype LinkQueue::GetQueue()
{
if (rear==front) throw "下溢";
return front->next->data;
}
bool LinkQueue::isEmpty()
{
if (rear==front)
{
return true;
}else return false;
}
int LinkQueue::GetQueueLength()
{
// 求队列的长度
int i=0;
QueueNode *p;
p=front;
while(rear!=p)
{
i++;
p=p->next;
}
return i;
}
{
while(front!=NULL)
{
QueueNode * tmp=front;
front=front->next;
delete tmp;
}
cout<<"链队列已销毁"<<endl;
}
void main()
{
LinkQueue lq;
lq.EnQueue(2);
lq.EnQueue(3);
cout<<lq.DeQueue();
}