[C++知识库]用c语言实现队列

头文件

#include<stdio.h>
#include<stdbool.h>
#include<assert.h>

typedef int QdataTyped;
typedef struct QueueNode
{
	struct QueueNode *next;
	QdataTyped data;
}QueueNode;

typedef struct Queue
{
	struct QueueNode *head;
	struct QueueNode *tail;
}Queue;

//初始化队列
void QueueInit(Queue *pq);

//销毁队列
void QueueDestory(Queue *pq);

//插入数据
void QueuePush(Queue *pq, QdataTyped x);

//删除数据
void QueuePop(Queue *pq);

//对首数据
QdataTyped QueueFront(Queue *pq);

//对尾数据
QdataTyped Queueback(Queue *pq);

//判断是否为空
bool QueueEmpty(Queue *pq);

//计算数据个数
int QueueSize(Queue *pq);

实现

#include"queue.h"


//初始化队列
void QueueInit(Queue *pq)
{
	pq->head = NULL;
	pq->tail = NULL;
}

//销毁队列
void QueueDestory(Queue *pq)
{
	QueueNode *cur = pq->head;
	while (cur != NULL)
	{
		QueueNode *next = cur->next;
		free(cur);
		cur = next;
	}
	pq->head = pq->tail = NULL;
}

//插入数据
void QueuePush(Queue *pq, QdataTyped x)
{
	assert(pq);
	QueueNode *newnode = (QdataTyped *)malloc(sizeof(QueueNode));
	if (newnode == NULL)
	{
		printf("malloc fail\n");
		exit(-1);
	}
	newnode->data = x;
	newnode->next = NULL;

	if (QueueEmpty(pq))
	{
		pq->head = pq->tail = newnode;
	}
	else{
		(pq->tail)->next = newnode;
		pq->tail = newnode;
	}

}

//删除数据
void QueuePop(Queue *pq)
{
	assert(pq);
	assert(!QueueEmpty(pq));

	if (pq->head->next == NULL)
	{
		free(pq->head);
		pq->head = pq->tail = NULL;
	}
	else
	{
		QueueNode *next = pq->head->next;
		free(pq->head);
		pq->head = next;
	}
}

//对首数据
QdataTyped QueueFront(Queue *pq)
{
	assert(pq);
	assert(!QueueEmpty(pq));

	return pq->head->data;
}

//对尾数据
QdataTyped Queueback(Queue *pq)
{
	assert(pq);
	assert(!QueueEmpty(pq));

	return pq->tail->data;
}

//判断是否为空
bool QueueEmpty(Queue *pq)
{
	return pq->head == NULL;
}

//计算数据个数
int QueueSize(Queue *pq)
{
	int size = 0;
	QueueNode *cur = pq->head;
	while (cur != NULL)
	{
		size++;
		cur = cur->next;
	}
	return size;
}