链式队列(带头节点,头指针,尾指针的单链表)
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
//链式队列(头指针指向头节点,尾指针指向尾节点)
typedef struct Qnode {
int data;
struct Qnode* next;
} Qnode, *LQueue;
typedef struct {
LQueue front;
LQueue rear;
} LinkQueue;
//初始化
void initLinkQueue(LinkQueue* q) {
LQueue head = (Qnode*)malloc(sizeof(Qnode));
head->data = NULL;
head->next = NULL;
q->front = head;
q->rear = head;
}
//入队
void enQueue(LinkQueue* q, int e) {
Qnode* p = (Qnode*)malloc(sizeof(Qnode));
p->data = e;
p->next = NULL;
q->rear->next = p;
q->rear = p;
}
//出队
void deQueue(LinkQueue* q, int* res) {
//需要判断队空
if (q->front == q->rear)
{
printf("队空\n");
return;
}
Qnode* p = q->front->next;
*res = p->data;
q->front->next = q->front->next->next;
//如果是最后一个元素被删除,则需要修改尾指针指向头节点
if (q->rear == p)
{
q->rear = q->front;
}
free(p);
}
//取队头元素
int getHead(LinkQueue* q) {
if (q->front == q->rear)
{
printf("队空\n");
return -999;
}
return q->front->next->data;
}
void main() {
LinkQueue q;
initLinkQueue(&q);
printf("刚初始化后测试取队头元素===>%d\n", getHead(&q));
for (int i = 0; i < 10; i++)
{
enQueue(&q, i);
}
printf("入队后测试取队头元素===>%d\n", getHead(&q));
int res;
for (int i = 0; i < 10; i++)
{
printf("出队前测试取队头元素===>%d\n", getHead(&q));
deQueue(&q, &res);
printf("出队后测试取队头元素===>%d 与 出队元素===>%d\n", getHead(&q),res);
}
}