#include<stdio.h>//链队列的存储结构
#include<stdlib.h>
#define OVERFLOW -2
typedef int QElemType;
typedef struct QNode{//此处本来没加QNode,错误爆出???为何???
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct{
QueuePtr front;
QueuePtr rear;
}LinkQueue;
void InitQueue(LinkQueue *Q)
{//构造一个空队列Q
Q->front=Q->rear=(QueuePtr)malloc(sizeof(QNode));
if(!Q->front) exit(OVERFLOW);
Q->front->next=NULL;
printf("构造队列成功..../n");
}
void DestroyQueue(LinkQueue *Q)
{//销毁队列
while(Q->front)
{
Q->rear=Q->front->next;
free(Q->front);
Q->front=Q->rear;
}
printf("销毁队列成功!!!/n");
exit(0);
}
void EnQueue(LinkQueue *Q,QElemType e)
{//插入元素e为Q的新的队尾元素
QueuePtr p;
printf("ok now which number do you want input/n");
scanf("%d",&e);
p=(QueuePtr)malloc(sizeof(QNode));
if(!p) exit(OVERFLOW);
p->data=e;
p->next=NULL;
Q->rear->next=p;
Q->rear=p;
printf("插入元素成功/n");
}
void DeQueue(LinkQueue *Q,QElemType e)
{//若队列不空,则删除Q的队头元素,用e返回其值
QueuePtr p;
if(Q->front==Q->rear) {printf("队列为空!!!/n无法删除");exit(0);}
p=Q->front->next;
e=p->data;
Q->front->next=p->next;
if(Q->rear==p) Q->rear=Q->front;
free(p);
printf("删除成功!/n");
}
void PrintQueue(LinkQueue *Q)
{
if(Q->front==Q->rear) {printf("sorry the Queue is empty");exit(0);}
while(Q->front!=Q->rear)
{
printf("%d ",Q->front->next->data);
Q->front=Q->front->next;
}
printf("/nPrint is over/n");
}
int main()
{
LinkQueue Q;
QElemType e;
InitQueue(&Q);
int i;
printf("please put you num what you want to do:/n1:destroy the queue/n2:enqueue/n3:dequeue/n4:printqueue/n");
scanf("%d",&i);
while(i)
{
switch(i)
{
case 1:DestroyQueue(&Q);break;//DestroyQueue(LinkQueue *Q)
case 2:EnQueue(&Q,e);break;
case 3:DeQueue(&Q,e);break;
case 4:PrintQueue(&Q);break;
}
printf("you can choose again for/n1:destroy/n2:enqueue/n3:dequeue/n4:printqueue/n");
scanf("%d",&i);
}
return 0;
}
链队列基本操作
最新推荐文章于 2023-02-24 22:26:04 发布