数据结构—循环队列

#include <iostream>
#include <list>
using namespace std;
#define MAXSIZE 5
typedef struct Queue {
	int front;
	int rear;
	int data[MAXSIZE];
}Queue;

Queue* initQueue() {
	Queue* q = new Queue;
	q->front = 0;
	q->rear = 0;
	return q;
}
int isFull(Queue* q)
{
	if ((q->rear + 1) % MAXSIZE == q->front)
	{
		return 1;
	}
	return 0;
}

int isEmpty(Queue* q)
{
	if (q->front == q->rear)
	{
		return 1;
	}
	return 0;
}

int enQueue(Queue* q,int data)
{
	if (isFull(q))
	{
		printf("dui lie man lla\n ");
		return 0;
	}
	q->data[q->rear] = data;
	q->rear = (q->rear + 1) % MAXSIZE;
	return 1;
}

int deQueue(Queue* q)
{
	if (isEmpty(q))
	{
		printf("dui lie wei kong\n ");
		return -1;
	}
	int d = q->data[q->front];
	q->front = (q->front + 1) % MAXSIZE;
	return d;
}

void printfQueue(Queue* q)
{
	int len = (q->rear - q->front + MAXSIZE) % MAXSIZE;
	for (int i = 0; i < len; i++)
	{
		int d = q->data[(q->front + i) % MAXSIZE];
		printf("%d\n", d);
	}
	
}

int main()
{
	Queue* queue = initQueue();
	enQueue(queue, 1);
	enQueue(queue, 2);
	enQueue(queue, 3);
	enQueue(queue, 4);
	enQueue(queue, 5);
	enQueue(queue, 6);
	enQueue(queue, 7);
	enQueue(queue, 8);
	printfQueue(queue);

	int  data = deQueue(queue);
	cout << "deQueue1:" << data << endl;

	data = deQueue(queue);
	cout << "deQueue2:" << data << endl;

	data = deQueue(queue);
	cout << "deQueue3:" << data << endl;

	printfQueue(queue);

	system("pause");
}