1.队列的概念
队列只允许在一端进行插入数据操作,在另一端进行删除数据操作的特殊线性表,队列具有先进先出FIFO(First In First Out)的原则。
入队列:进行插入操作的一端称为队尾
出队列:进行删除操作的一端称为队头
2.队列的实现
2.1队列的结构
typedef int QTypeData;
typedef struct QueueNode
{
QTypeData val;
struct QueueNode* next;
}QNode;
但是这样写会造成后面的代码很麻烦,比如:
队列的插入和删除
QueuePush(QNode** pphead, QNode** pptail, QTypeData x);
QueuePop(QNode** pphead, QNode** pptail);//会有双指针
所以为了避免这种情况,我们把头和尾再弄一个结构体存储他们。
队列的整体结构:
typedef int QTypeData;
typedef struct QueueNode
{
QTypeData val;
struct QueueNode* next;
}QNode;
//多个值(头、尾)
typedef struct Queue
{
QNode* phead;//头删
QNode* ptail;//尾插
int size;
}Que;
2.2队列的初始化
void QueueInit(Que* pq)
{
assert(pq);
pq->phead = pq->ptail = NULL;
pq->size = 0;
}
2.3队列的销毁
void QueueDestory(Que* pq)
{
assert(pq);
QNode* pcur = pq->phead;
while (pcur)
{
pq->phead = pcur->next;
free(pcur);
pcur = pq->phead;
}
pq->phead = NULL;
pq->ptail = NULL;
pq->size = 0;
}
2.4入队列
void QueuePush(Que* pq, QTypeData x)
{
assert(pq);
QNode* newnode = (QNode*)malloc(sizeof(QNode));
if (newnode == NULL)
{
perror("malloc fail");
return;
}
newnode->val = x;
newnode->next = NULL;
if (pq->ptail==NULL)
{
pq->phead = pq->ptail = newnode;
}
else
{
pq->ptail->next = newnode;
pq->ptail = newnode;
}
pq->size++;
}
2.5出队列
void QueuePop(Que* pq)
{
assert(pq);
assert(pq->phead);
//多个节点、一个节点
if (pq->phead->next == NULL)
{
free(pq->phead);
pq->phead = pq->ptail = NULL;
}
else
{
QNode* pphead = pq->phead->next;
free(pq->phead);
pq->phead = pphead;
}
pq->size--;
}
2.6队列的头
QTypeData QueueFront(Que* pq)
{
assert(pq);
assert(pq->phead != NULL);
return pq->phead->val;
}
2.7队列的尾
QTypeData QueueBack(Que* pq)
{
assert(pq);
assert(pq->ptail);
return pq->ptail->val;
}
2.8判断队列是否为空
bool QueueEmpty(Que* pq)
{
assert(pq);
return pq->size == 0;
}
2.9求队列的长度
int QueueSize(Que* pq)
{
assert(pq);
return pq->size;
}
3.整体代码
Queue.h
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<stdbool.h>
typedef int QTypeData;
typedef struct QueueNode
{
QTypeData val;
struct QueueNode* next;
}QNode;
//多个值(头、尾)
typedef struct Queue
{
QNode* phead;//头删
QNode* ptail;//尾插
int size;
}Que;
void QueueInit(Que* pq);
void QueueDestory(Que* pq);
//入队列
void QueuePush(Que* pq, QTypeData x);
//出队列
void QueuePop(Que* pq);
QTypeData QueueFront(Que* pq);
QTypeData QueueBack(Que* pq);
bool QueueEmpty(Que* pq);
int QueueSize(Que* pq);
Queue.c
#include"Queue.h"
void QueueInit(Que* pq)
{
assert(pq);
pq->phead = pq->ptail = NULL;
pq->size = 0;
}
void QueueDestory(Que* pq)
{
assert(pq);
QNode* pcur = pq->phead;
while (pcur)
{
pq->phead = pcur->next;
free(pcur);
pcur = pq->phead;
}
pq->phead = NULL;
pq->ptail = NULL;
pq->size = 0;
}
//入队列
void QueuePush(Que* pq, QTypeData x)
{
assert(pq);
QNode* newnode = (QNode*)malloc(sizeof(QNode));
if (newnode == NULL)
{
perror("malloc fail");
return;
}
newnode->val = x;
newnode->next = NULL;
if (pq->ptail==NULL)
{
pq->phead = pq->ptail = newnode;
}
else
{
pq->ptail->next = newnode;
pq->ptail = newnode;
}
pq->size++;
}
//出队列
void QueuePop(Que* pq)
{
assert(pq);
assert(pq->phead);
//多个节点、一个节点
if (pq->phead->next == NULL)
{
free(pq->phead);
pq->phead = pq->ptail = NULL;
}
else
{
QNode* pphead = pq->phead->next;
free(pq->phead);
pq->phead = pphead;
}
pq->size--;
}
QTypeData QueueFront(Que* pq)
{
assert(pq);
assert(pq->phead != NULL);
return pq->phead->val;
}
QTypeData QueueBack(Que* pq)
{
assert(pq);
assert(pq->ptail);
return pq->ptail->val;
}
bool QueueEmpty(Que* pq)
{
assert(pq);
return pq->size == 0;
}
int QueueSize(Que* pq)
{
assert(pq);
return pq->size;
}
Test.c
#include"Queue.h"
int main()
{
Que q;
QueueInit(&q);
QueuePush(&q, 1);
QueuePush(&q, 2);
QueuePush(&q, 3);
QueuePush(&q, 4);
QueuePush(&q, 5);
QueuePush(&q, 6);
printf("%d", QueueFront(&q));
while (!QueueEmpty(&q))
{
printf("%d ", QueueFront(&q));
QueuePop(&q);
}
QueueDestory(&q);
}