队列的基本操作与应用

顺序队列

/***循环队列基本操作***/

#include <iostream>
#include <fstream>
using namespace std;

#define MAXQSIZE 100
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef char QElemType;
typedef char SElemType;
typedef int Status;

typedef struct {
	QElemType *base;//初始化时动态分配存储空间
	int front;//头指针
	int rear;//尾指针
} SqQueue;

//算法3.11　循环队列的初始化
Status InitQueue(SqQueue &Q) {//构造一个空队列Q
	Q.base = new QElemType[MAXQSIZE]; //为队列分配一个最大容量为MAXSIZE的数组空间
	if (!Q.base)
		exit(OVERFLOW); //存储分配失败
	Q.front = Q.rear = 0; //头指针和尾指针置为零，队列为空
	return OK;
}

//算法3.12　求循环队列的长度
int QueueLength(SqQueue Q) {//返回Q的元素个数，即队列的长度
	return (Q.rear - Q.front + MAXQSIZE) % MAXQSIZE;
}

//算法3.13　循环队列的入队
Status EnQueue(SqQueue &Q, QElemType e) {//插入元素e为Q的新的队尾元素
	if ((Q.rear + 1) % MAXQSIZE == Q.front) //尾指针在循环意义上加1后等于头指针，表明队满
		return ERROR;
	Q.base[Q.rear] = e; //新元素插入队尾
	Q.rear = (Q.rear + 1) % MAXQSIZE; //队尾指针加1
	return OK;
}

//算法3.14　循环队列的出队
Status DeQueue(SqQueue &Q, QElemType &e) {//删除Q的队头元素，用e返回其值
	if (Q.front == Q.rear)
		return ERROR; //队空
	e = Q.base[Q.front]; //保存队头元素
	Q.front = (Q.front + 1) % MAXQSIZE; //队头指针加1
	return OK;
}

//算法3.15　取循环队列的队头元素
SElemType GetHead(SqQueue Q) {//返回Q的队头元素，不修改队头指针
	if (Q.front != Q.rear) //队列非空
		return Q.base[Q.front]; //返回队头元素的值，队头指针不变
}

int main() {
	int choose, flag = 0;
	SqQueue Q;
	QElemType e, j;
	cout << "1.初始化\n";
	cout << "2.入队\n";
	cout << "3.读队头元素\n";
	cout << "4.出队\n";
	cout << "0.退出\n\n";

	choose = -1;
	while (choose != 0) {
		cout << "请选择:";
		cin >> choose;
		switch (choose) {
			case 1://算法3.12　循环队列的初始化
				if (InitQueue(Q)) {
					flag = 1;
					cout << "成功对队列进行初始化\n\n";
				} else
					cout << "初始化队列失败\n\n";
				break;
			case 2: {//算法3.13　循环队列的入队
				if (flag == 1) {
					cout << "请输入入队元素：\n";
					cin >> e;
					EnQueue(Q, e);
					cout << "元素：" << e << " 入队成功！" << endl;
				} else
					cout << "队列未建立，请重新选择\n\n";
			}
			break;
			case 3://算法3.14　取循环队列的队头元素
				if (Q.front != Q.rear)
					cout << "队头元素为：\n" << GetHead(Q) << endl << endl;
				else
					cout << "队列中无元素，请重新选择\n" << endl;
				break;
			case 4://算法3.15　循环队列的出队
				cout << "依次弹出的队头元素为:\n";
				while (Q.front != Q.rear) {
					DeQueue(Q, e);
					cout << e << "  ";
				}
				cout << endl << endl;
				break;
		}
	}
	return 0;
}

链式队列

/***链队的基本操作***/

#include<iostream>
#include<fstream>
using namespace std;

#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef char QElemType;
typedef int Status;
typedef char SElemType;

//- - - - - 队列的链式存储结构- - - - - 
typedef struct QNode {
	QElemType data;
	struct QNode *next;
} QNode, *QueuePtr;
typedef struct {
	QueuePtr front; //队头指针
	QueuePtr rear; //队尾指针
} LinkQueue;

//算法3.16　链队的初始化
Status InitQueue(LinkQueue &Q) {//构造一个空队列Q
	Q.front = Q.rear = new QNode; //生成新结点作为头结点，队头和队尾指针指向此结点
	Q.front->next = NULL; //头结点的指针域置空
	return OK;
}

//算法3.17　链队的入队
Status EnQueue(LinkQueue &Q, QElemType e) {//插入元素e为Q的新的队尾元素
	QueuePtr p;
	p = new QNode; //为入队元素分配结点空间，用指针p指向
	p->data = e; //将新结点数据域置为e
	p->next = NULL;
	Q.rear->next = p; //将新结点插入到队尾
	Q.rear = p; //修改队尾指针
	return OK;
}

//算法3.18　链队的出队
Status DeQueue(LinkQueue &Q, QElemType &e) {//删除Q的队头元素，用e返回其值 
	QueuePtr p;
	if (Q.front == Q.rear)
		return ERROR; //若队列空，则返回ERROR
	p = Q.front->next; //p指向队头元素
	e = p->data; //e保存队头元素的值
	Q.front->next = p->next; //修改头指针
	if (Q.rear == p)
		Q.rear = Q.front; //最后一个元素被删，队尾指针指向头结点
	delete p; //释放原队头元素的空间
	return OK;
}

//算法3.19　取链队的队头元素
SElemType GetHead(LinkQueue Q) {//返回Q的队头元素，不修改队头指针
	if (Q.front != Q.rear) //队列非空
		return Q.front->next->data; //返回队头元素的值，队头指针不变
}
int main() {
	int choose, flag = 0;
	LinkQueue Q;
	QElemType e, j;
	cout << "1.初始化\n";
	cout << "2.入队\n";
	cout << "3.读队头元素\n";
	cout << "4.出队\n";
	cout << "0.退出\n\n";

	choose = -1;
	while (choose != 0) {
		cout << "请选择:";
		cin >> choose;
		switch (choose) {
			case 1://算法3.16　链队的初始化
				if (InitQueue(Q)) {
					flag = 1;
					cout << "成功对队列进行初始化\n\n";
				} else
					cout << "初始化队列失败\n\n";
				break;
			case 2: {//算法3.17　链队的入队
				if (flag == 1) {
					cout << "请输入入队元素：\n";
					cin >> e;
					EnQueue(Q, e);
					cout << "元素：" << e << " 入队成功！" << endl;
				} else
					cout << "队列未建立，请重新选择\n\n";
			}
			break;
			case 3://算法3.19　取链队的队头元素
				if (Q.front != Q.rear)
					cout << "队头元素为：\n" << GetHead(Q) << endl << endl;
				else
					cout << "队列中无元素，请重新选择\n" << endl;
				break;
			case 4://算法3.18　链队的出队
				cout << "依次弹出的队头元素为:\n";
				while (Q.front != Q.rear) {
					DeQueue(Q, e);
					cout << e << "  ";
				}
				cout << endl << endl;
				break;
		}
	}
	return 0;
}