#include<iostream>
#include<stdlib.h>
#define ERROR 0
#define OK 1
using namespace std;
struct Node{
int data;
Node *next;
};
typedef Node* que;
typedef struct{
que front;
que rear;
}lkq;
int Init(lkq &Q)
{
Q.front->next=NULL;
}
int Destroy(lkq &Q)
{
que p;
if(!Q.front) return ERROR;
while(Q.front->next){
p=Q.front->next;
Q.front->next=p->next;
free(p);
}
free(Q.front);
Q.front=Q.rear=NULL;
cout<<"队列已销毁"<<endl;
}
int Clear(lkq &Q)
{
que p;
if(!Q.front) return 0;
while(Q.front->next){
p=Q.front->next;
Q.front->next=p->next;
free(p);
}
Q.front=NULL;
cout<<"链表已清空"<<endl;
}
int Empty(lkq &Q)
{
if(Q.front->next==NULL)
cout<<"链表为空"<<endl;
else
cout<<"链表不为空"<<endl;
}
int Len(lkq &Q)
{
que p;
int len=0;
p=Q.front->next;
while(p)
{
len++;
p=p->next;
}
cout<<"队列中元素个数为:"<<len<<"个"<<endl;
}
int head(lkq &Q)
{
que p;
if(Q.front->next==NULL)cout<<"链表为空!!!"<<endl;
p=Q.front->next;
return p->data;
}
int cha(lkq &Q)
{
que p;
p=(que) malloc(sizeof(Node));
cout<<"请输入你要插入的元素值"<<endl;
cin>>p->data;
p->next=NULL;
Q.rear->next=p;
Q.rear=p;
}
int chu(lkq &Q)
{
if (Q.front==Q.rear) cout<<"错误"<<endl;
que p;
p=Q.front->next;
Q.front->next=p->next;
if (Q.rear==p) Q.rear=Q.front;
free(p);
}
int shuchu(lkq &Q)
{
que p;
p=Q.front->next;
while(p!=NULL)
{
cout<<p->data<<" ";
p=p->next;
}
cout<<endl;
}
lkq CreatQ()
{
lkq Q;
Q.front=Q.rear=(que)malloc(sizeof(Node));
if(!Q.front) cout<<"OVERFLOW"<<endl;
Q.front->next=NULL;
return Q;
}
int show()
{
cout<<"0----初始化队列"<<endl;
cout<<"1----销毁队列"<<endl;
cout<<"2----清空队列"<<endl;
cout<<"3----判断队列是否为空"<<endl;
cout<<"4----返回队列中元素个数"<<endl;
cout<<"5----返回队列头元素"<<endl;
cout<<"6----插入新的队尾元素"<<endl;
cout<<"7----删除队头元素"<<endl;
cout<<"8----初始化并创建队列"<<endl;
cout<<"9----输出队列元素"<<endl;
cout<<" 退出,输出一个负数!"<<endl;
}
int main()
{
show();
lkq Q;
int n;
while(1)
{
cout<<"请输入您想要进行的操作"<<endl;
cin>>n;
if(n==0)
Init(Q);
if(n==1)
Destroy(Q);
if(n==2)
Clear(Q);
if(n==3)
Empty(Q);
if(n==4)
Len(Q);
if(n==5)
head(Q);
if(n==6)
cha(Q);
if(n==7)
chu(Q);
if(n==8)
Q=CreatQ();
if(n==9)
shuchu(Q);
}
}
链队列的基本操作
最新推荐文章于 2024-01-24 21:28:12 发布