Queue.h
#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<malloc.h>
//单链表实现队列
typedef int DataType;
typedef struct QueueNode
{
DataType _data;
struct QueueNode* _next;
}QueueNode;
typedef struct Queue
{
QueueNode* _front;
QueueNode* _rear;
}Queue;
void QueueNodeInit(Queue* queue);
void QueueDestory(Queue* queue);
void QueuePush(Queue* queue, DataType x);//插入
void QueuePop(Queue* queue);//删除
void QueuePrint(Queue* queue);
int QueueEmpty(Queue* queue);//判断是否为空队列
DataType QueueFront(Queue* queue);//获取队头元素
DataType Queuerear(Queue* queue);//获取队尾元素
Queue.c
#include"Queue.h"
void QueueInit(Queue* queue) {
assert(queue);
queue->_front = NULL;
queue->_rear = NULL;
}
void QueuePush(Queue* queue, DataType x) {
assert(queue);
QueueNode* newNode = (QueueNode*)malloc(sizeof(QueueNode));
newNode->_data = x;
newNode->_next = NULL;
if (queue->_rear == NULL) {
queue->_rear = newNode;
queue->_front = newNode;
}
else {
queue->_rear->_next = newNode;
queue->_rear = queue->_rear->_next;
}
}
void QueuePop(Queue* queue) {
assert(queue);
if (queue->_front) {
QueueNode* next = queue->_front->_next;
free(queue->_front);
queue->_front = next;
//如果删除的是最后一个元素
if (queue->_front == NULL) {
queue->_rear = NULL;
}
}
}
DataType QueueFront(Queue* queue) {
assert(queue);
return queue->_front->_data;
}
DataType Queuerear(Queue* queue) {
assert(queue);
return queue->_rear->_data;
}
int QueueEmpty(Queue* queue) {
assert(queue);
if (queue->_front == NULL) {
return 1;
}
return 0;
}
void QueuePrint(Queue* queue) {
assert(queue);
QueueNode* cur = queue->_front;
while (cur) {
printf("%d", cur->_data);
cur = cur->_next;
}
printf("\n");
}
void QueueDestory(Queue* queue) {
assert(queue);
QueueNode* cur = queue->_front;
while (cur) {
QueueNode* next = cur->_next;
free(cur);
cur = next;
}
queue->_front = queue->_rear = NULL;
}
void test() {
Queue queue;
QueueInit(&queue);
QueuePush(&queue, 1);
QueuePush(&queue, 2);
QueuePush(&queue, 3);
QueuePush(&queue, 4);
QueuePrint(&queue);
QueuePop(&queue);
QueuePrint(&queue);
QueuePop(&queue);
QueuePrint(&queue);
QueuePop(&queue);
QueuePrint(&queue);
QueuePop(&queue);
QueuePrint(&queue);
}
int main() {
test();
system(“pause”);
return 0;
}