循环队列及其基本操作

包含循环队列构造、初始化、入队、出队、创建、输出队列。

# include<iostream>
using namespace std;

# define MAXSIZE 99

//循环队列 
struct Queue{
	int *base;
	int front;
	int rear;
};

//循环队列初始化 
void InitQueue(Queue &Q) {
	Q.base = new int[MAXSIZE];
	Q.front = Q.rear = 0;
}
//循环队列入队
int Push(Queue &Q,int e) {
	if ((Q.rear + 1) % MAXSIZE == Q.front)
		return 0;
	Q.base[Q.rear] = e;
	Q.rear = (Q.rear + 1) % MAXSIZE;

}

//循环队列出队
int pop(Queue &Q) {
	int e;
	if (Q.front == Q.rear)
		return 0;
	e = Q.base[Q.front];
	Q.front = (Q.front + 1) % MAXSIZE;
	return e;	//返回队头 
}

//循环队列的创建
void CreateQueue(Queue &Q) {
	int e;
	int n;
	cout <<	"请输入您要输入的队列长度:";
	cin >> n;
	for(int i = 0;i < n;i++){
		cin >> e;
		Push(Q,e);	//实现在队尾入队 
	}
}

//循环队列输出队列 
void Display(Queue &Q) {
	if (Q.front == Q.rear)
	cout << "队列为空" <<endl; 
	else {
		int i;
		for (i = Q.front; i < Q.rear; i++)
			cout << Q.base[i] << ' ';
	}
	cout << endl;
}

int main() {
	int e; 
	Queue Q;
	InitQueue(Q);
	CreateQueue(Q);
	Display(Q);
	e = pop(Q);
	cout << "队头元素为:" << e << endl; 
	cout << "出队后队列为：";
	Display(Q); 
	return 0;
}