郝斌老师【数据结构入门】之队列程序演示

#include<stdio.h>
#include<malloc.h>


typedef struct Queue
{
	int * pBase;
	int front;
	int rear;
}QUEUE;

void init(QUEUE *);

//入队
bool en_queue(QUEUE *, int);

//遍历
void traverse(QUEUE *);

bool full_queue(QUEUE*);

bool empty_queue(QUEUE *);

//出队
bool out_queue(QUEUE *, int *);

int main()
{
	QUEUE Q;
	int val;

	init(&Q);

	/*en_queue(&Q, 1);
	en_queue(&Q, 2);
	en_queue(&Q, 3);
	en_queue(&Q, 4);
	en_queue(&Q, 5);
	en_queue(&Q, 6);
	en_queue(&Q, 7);
	en_queue(&Q, 8);*/

	traverse(&Q);

	if (out_queue(&Q, &val))
	{
		printf("出队成功，队列出队的元素为%d\n ", val);
	}
	else
	{
		printf("出队失败！");
	}
	traverse(&Q);

	return 0;
}

//初始化
void init(QUEUE *pQ)
{
	pQ->pBase = (int *)malloc(sizeof(int) * 6);

	pQ->front = 0;
	pQ->rear = 0;
}

//入队
bool en_queue(QUEUE *pQ, int val)
{
	if (full_queue(pQ))
	{
		return false;
	}
	else
	{
		pQ->pBase[pQ->rear] = val;
		pQ->rear = (pQ->rear + 1) % 6;
		return true;
	}
}

//判断是否满
bool full_queue(QUEUE* pQ)
{
	if ((pQ->rear + 1) % 6 == pQ->front)
	{
		return true;
	}
	else
	{
		return false;
	}
}

void traverse(QUEUE *pQ)
{
	int i = pQ->front;

	while (i != pQ->rear)
	{
		printf("%d ", pQ->pBase[i]);
		i = (i + 1) % 6;
	}
	return;
}

bool empty_queue(QUEUE *pQ)
{
	if (pQ->front == pQ->rear)
	{
		return true;
	}
	else
	{
		return false;
	}
}

bool out_queue(QUEUE *pQ, int *pVal)
{
	if (empty_queue(pQ))
	{
		return false;
	}
	else
	{
		*pVal = pQ->pBase[pQ->front];
		pQ->front = (pQ->front + 1) % 6;
		return true;
	}
}