链队列和循环队列的基本操作

#include
#include<stdio.h>
#include<malloc.h>
#define NE 10
using namespace std;

//链队列
class Queue {
public:
int data;
Queue *next;
};

class QueuePtr {
public:
Queue *front;
Queue *rear;
};

//循环队列
class SqQueue {
public:
int *base;
int front;
int rear;
int count;
SqQueue() {
front=0;
rear=0;
count=0;
base = new int[NE];
}
~SqQueue() {

	}

};

//链队列
void Setqueue(QueuePtr &Q) {
Queue *q = new Queue;
if(!q)
cout << “队列空间开辟失败！”;
q->next = NULL;
Q.front = Q.rear = q;
}
void Enqueue(QueuePtr &Q) {
int n;
cout << “请输入进队的个数：” ;
cin >> n;
cout << “请输入数据：” << endl;
for(int i=0; i<n; i++) {
Queue *q = new Queue;
if(!q)
cout << “队列空间开辟失败！”;
else {
cin >> q->data;
q->next = NULL;
Q.rear->next = q;
Q.rear = q;
}

}

}

//删除出队操作
void Dequeue(QueuePtr &Q) {
if(Q.front != Q.rear) {
Queue *q = Q.front->next;
int num;
num = q->data;
cout << “删除数据：” << num << endl;
Q.front->next = q->next;
if(Q.rear == q) {
Q.rear = Q.front;
}
free(q);
} else
cout << “此队列为空！！” << endl;

}
//输出队列中元素
void OutputQueue(QueuePtr &Q) {
if(Q.front != Q.rear) {
Queue *q = Q.front->next;
cout << “输出队列数据为：” << endl;
while(q) {
cout << q->data << “\t”;
q = q->next;
}
} else
cout << “此队列为空！！” << endl;

}

//读取链队列第一个元素
void ReadQueue(QueuePtr &Q) {
if(Q.front==Q.rear)
cout << " 此队列为空!!" << endl;
Queue *q = Q.front->next;
int num;
num = q->data;
cout << “第一个元素为：” << num << endl;
}

//循环队列
//初始化队列操作
void EnQueue(SqQueue &Sq) {
if(Sq.count==NE)
cout << “队列以满！”;
else {
int n;
cout << “请输入需要入队的个数:” << endl;
cin >> n;
if(n+Sq.count < NE) {
cout << “输入进队数据”;
for(int i=0; i<n; i++) {
int e;
cin >> e;
Sq.base[Sq.rear] = e; //将元素放入队列尾部
Sq.rear = (Sq.rear + 1) % NE;
Sq.count++;
}
}
}
}

//读取队列的第一个元素
void ReadSqQueue(SqQueue &Sq) {
if (Sq.count == 0)
cout << “队列为空！” << endl;
else
cout << “第一个元素：” <<Sq.base[Sq.front] << endl;
}

//从队列中出元素
void DeQueue(SqQueue &Sq) {
int e;
if(Sq.front==Sq.rear)
cout << “此栈为空！！” << endl;
e = Sq.base[Sq.front];
cout << e;
Sq.front = (Sq.front + 1) % NE;
Sq.count–;
}

void OutputSQueue(SqQueue &Sq) {
cout << “数据为：”;
int m;
m = Sq.count;
for(int i=0; i<m; i++) {
cout << Sq.base[Sq.front] << “\t”;
Sq.front = (Sq.front + 1) % NE;
Sq.count–;
}

}

void Menu() {
cout << “1.链式队列” << endl;
cout << “2.循环队列” << endl;
cout << “请选择队列类型：” << endl;
}

void Menuqueue() {
system(“pause”);
system(“cls”);
cout << “1.初始化队列” << endl << “2.读取第一个元素”<< endl <<“3.删除一个元素” << endl << “4.输出所有元素” << endl ;
cout << “请选择你要执行的功能：”;
}

int main() {
Menu();
int choice;
SqQueue Sq;
QueuePtr Q;
Setqueue(Q);
cin >> choice;
if(choice == 1) {
while(true) {

		Menuqueue();
		int choice;
		cin >> choice;
		cout << endl;
		switch(choice) {
			case 1:
				
				Enqueue(Q);
				break;
			case 2:
				ReadQueue(Q);
				break;
			case 3:
				Dequeue(Q);
				break;
			case 4:
				OutputQueue(Q);
				break;
		}
	}
} else if(choice == 2) {
	while(true) {
		Menuqueue();
		int choice;
		cin >> choice;
		cout << endl;
		switch(choice) {
			case 1:
				EnQueue(Sq);
				break;
			case 2:
				ReadSqQueue(Sq);
				break;
			case 3:
				DeQueue(Sq);
				break;
			case 4:
				OutputSQueue(Sq);
				break;
		}
	}

}

return 0;

}