PS:如果手机显示不完全可以用电脑查看
#include<stdio.h>
#include<stdlib.h>
#define ok 1
#define error 0
typedef int status;
typedef int qelemtype;
typedef struct qnode
{
qelemtype data;
struct qnode *next;
}qnode, *queueptr;
typedef struct
{
queueptr front;
queueptr rear;
}linkqueue;
status initqueue(linkqueue &q)//构造一个空队列
{
q.front = q.rear = (queueptr)malloc(sizeof(qnode));
if (!q.front)
return error;//申请失败
q.front->next = NULL;//队头指向空
return ok;
}
status destroyqueue(linkqueue &q)//销毁队列
{
while (q.front)
{
q.rear = q.front->next;//使队尾指向队头的下一个元素
free(q.front);//删除队头
q.front = q.rear;//将队头链接到队尾
}
return ok;
}
status clearqueue(linkqueue &q)//清空队列
{
while (q.front->next!=NULL)
{
q.rear = q.front->next;
q.front->next = q.rear->next;//右边等价于q.front->next->next
free(q.rear);
}
q.rear = q.front;
return ok;
}
status queueempty(linkqueue q)//队列判空
{
if (q.front == q.rear)//队尾等于队头
return ok;
else
return error;
}
void queuelength(linkqueue q)//求队列的长度
{
int i = 0;
queueptr p = q.front->next;
while (p)
{
i++;
p = p->next;
}
printf("此时队列的长度为:%d\n", i);
}
status gethead(linkqueue q, qelemtype &e)//取队头元素
{
if (q.front == q.rear)
return error;
e = q.front->next->data;
return ok;
}
status enqueue(linkqueue &q, qelemtype e)//在队头插入元素e
{
queueptr p = (queueptr)malloc(sizeof(qnode));
if (!p)
return error;
p->data = e;
p->next = NULL;
q.rear->next = p;//将队尾的下一个指针域指到p
q.rear = p;//令队尾等于它的下一个指针域
return ok;
}
status dequeue(linkqueue &q, qelemtype &e)//删除队头元素,并用e返回
{
if (q.front == q.rear)
return error;
queueptr p = q.front->next;
e = p->data;
q.front->next = p->next;//等价于q.front->next=q.front->next->next,跳过p所在的指针域
if (q.rear == p)//如果删除后队列为空
q.rear = q.front;
free(p);
return ok;
}
status queuetraverse(linkqueue q)//打印出队列中的元素
{
if (q.front == q.rear)
return error;
queueptr p = q.front->next;
printf("目前队列的状态为:");
while (p)
{
printf("%3d", p->data);
p = p->next;
}
printf("\n");
return ok;
}
int main()
{
int i;
linkqueue q;
qelemtype e;
if (initqueue(q) == ok)
printf("成功创建一个空队列!\n");
else
printf("队列初始化失败!\n");
for (i = 1; i <= 5; i++)
enqueue(q, i);
queuetraverse(q);
queuelength(q);
printf("把元素6插入到队列中\n");
enqueue(q, 6);
queuetraverse(q);
queuelength(q);
printf("使第一个元素出队列\n");
dequeue(q, e);
queuetraverse(q);
printf("被删除的队头元素是:%d\n", e);
gethead(q, e);
printf("此时新的队头元素是:%d\n", e);
if (queueempty(q) == ok)
printf("此时队列为空!\n");
else
printf("此时队列不空!\n");
if (clearqueue(q) == ok)
printf("置空成功!\n");
if (queueempty(q) == ok)
printf("此时队列为空!\n");
else
printf("此时队列不空!\n");
//printf("hello wolrd!");
system("pause");
return 0;
}