基础介绍
用链表实现的队列
代码
#include "stdio.h"
#include "stdlib.h"
#include "io.h"
#include "math.h"
#include "time.h"
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 20 /* 存储空间初始分配量 */
typedef int Status;
typedef int QElemType; /* QElemType类型根据实际情况而定,这里假设为int */
//节点结构
typedef struct QNode
{
QElemType data;
struct QNode* next;
}QNode , *QueuePtr;
//队列的链表结构
typedef struct
{
QueuePtr front;
QueuePtr rear;
}LinkQueue;
Status visit(QElemType c)
{
printf("%d ", c);
return OK;
}
//构造一个空队列Q
Status InitQueue(LinkQueue* Q)
{
Q->front = Q->rear = new QNode();
Q->front->next = NULL;
return OK;
}
//销毁队列Q
Status DestoryQueue(LinkQueue* Q)
{
while (Q->front)
{
Q->rear = Q->front->next;
delete(Q->front);
Q->front = Q->rear;
}
return OK;
}
//将Q清为空队列
Status ClearQueue(LinkQueue* Q)
{
QueuePtr p;
QueuePtr q;
Q->rear = Q->front;
p = Q->front->next;
Q->front->next = NULL;
while (p)
{
q = p;
p = p->next;
free(q);
}
return OK;
}
//判断Q是否为空队列
Status QueueEmpty(LinkQueue* Q)
{
if (Q->front == Q->rear)
return TRUE;
else
return FALSE;
}
//求队列长度
int QueueLength(LinkQueue* Q)
{
int i = 0;
QueuePtr p;
p = Q->front;
while (Q->rear != p)
{
i++;
p = p->next;
}
return i;
}
//返回队列的头部元素
Status GetHead(LinkQueue* Q, QElemType* e)
{
QueuePtr p;
if (Q->front == Q->rear)
return ERROR;
p = Q->front->next;
*e = p->data;
return OK;
}
//插入元素为Q的新的队尾元素
Status EnQueue(LinkQueue* Q, QElemType e)
{
QueuePtr p = new QNode();
p->data = e;
p->next = NULL;
Q->rear->next = p;//连接
Q->rear = p;//移动尾指针
return OK;
}
// 删除队列的头元素
Status DeQueue(LinkQueue* Q, QElemType* e)
{
QueuePtr p;
if (Q->front == Q->rear)
return ERROR;
p = Q->front->next; //待删除的元素
*e = p->data;
Q->front->next = p->next;//修改头指针位置
if (Q->rear == p) //若队头就是队尾,则删除后将rear指向头结点
Q->rear = Q->front;
delete p;
return OK;
}
/* 从队头到队尾依次对队列Q中每个元素输出 */
Status QueueTraverse(LinkQueue *Q)
{
QueuePtr p;
p = Q->front->next;
while (p)
{
visit(p->data);
p = p->next;
}
printf("\n");
return OK;
}
int main()
{
int i;
QElemType d;
LinkQueue q;
i = InitQueue(&q);
if (i)
printf("成功地构造了一个空队列!\n");
printf("是否空队列?%d(1:空 0:否) ", QueueEmpty(&q));
printf("队列的长度为%d\n", QueueLength(&q));
EnQueue(&q, -5);
EnQueue(&q, 5);
EnQueue(&q, 10);
printf("插入3个元素(-5,5,10)后,队列的长度为%d\n", QueueLength(&q));
printf("是否空队列?%d(1:空 0:否) ", QueueEmpty(&q));
printf("队列的元素依次为:");
QueueTraverse(&q);
i = GetHead(&q, &d);
if (i == OK)
printf("队头元素是:%d\n", d);
DeQueue(&q, &d);
printf("删除了队头元素%d\n", d);
i = GetHead(&q, &d);
if (i == OK)
printf("新的队头元素是:%d\n", d);
ClearQueue(&q);
printf("清空队列后,q.front=%u q.rear=%u q.front->next=%u\n", q.front, q.rear, q.front->next);
DestoryQueue(&q);
printf("销毁队列后,q.front=%u q.rear=%u\n", q.front, q.rear);
return 0;
}