队列的代码实现

顺序队列

• 队列的数据结构定义

typedef int ElemType;
#define MaxSize 5
typedef struct
{
	ElemType data[MaxSize];
	int front, rear;
}SqQueue;

• 初始化队列

void InitQueue(SqQueue*& q)
{
	q = new SqQueue;
	q->front = q->rear = -1;
}

•  销毁队列

void DestoryQueue(SqQueue* q)
{
	delete q;
}

• 判断队列是否为空

bool QueueEmpty(SqQueue* q)
{
	return (q->rear == q->front);
}

•  进队

bool enQueue(SqQueue* q, ElemType e)
{
	if (q->rear == MaxSize - 1)
		return false;
	q->data[++q->rear] = e;
	return true;
}

• 出队

bool deQueue(SqQueue* q, ElemType& e)
{
	if (q->rear == q->front)
		return false;
	e = q->data[++q->front];
	return true;
}

•  测试代码

#include<iostream>
using namespace std;
typedef int ElemType;
#define MaxSize 5
typedef struct
{
	ElemType data[MaxSize];
	int front, rear;
}SqQueue;
//初始化队列
void InitQueue(SqQueue*& q)
{
	q = new SqQueue;
	q->front = q->rear = -1;
}
//销毁队列
void DestoryQueue(SqQueue* q)
{
	delete q;
}
//判断队列是否为空
bool QueueEmpty(SqQueue* q)
{
	return (q->rear == q->front);
}
//进队
bool enQueue(SqQueue* q, ElemType e)
{
	if (q->rear == MaxSize - 1)
		return false;
	q->data[++q->rear] = e;
	return true;
}
//出队列
bool deQueue(SqQueue* q, ElemType& e)
{
	if (q->rear == q->front)
		return false;
	e = q->data[++q->front];
	return true;
}
int main()
{
	SqQueue* q = NULL;
	InitQueue(q);
	int a;
	enQueue(q, 1);
	enQueue(q, 2);
	enQueue(q, 3);
	deQueue(q, a);
	cout <<  a << endl;
	deQueue(q, a);
	cout << a << endl;
	deQueue(q, a);
	cout << a << endl;
	DestoryQueue(q);
	return 0;
}

• 运行结果 

---

循环队列

循环队列的数据结构和顺序队列相同，初始化队列，销毁队列，判空同上

• 进队列

bool enQueue(SqQueue* q, ElemType e)
{
	if ((q->rear + 1) % MaxSize == q->front)
		return false;
	q->rear = (q->rear + 1) % MaxSize;
	q->data[q->rear] = e;
	return true;
}

• 出队列

bool deQueue(SqQueue* q, ElemType& e)
{
	if (q->rear == q->front)
		return false;
	q->front = (q->front + 1) % MaxSize;
	e = q->data[q->front];
	return true;
}

•  统计队列的元素个数

int Count(SqQueue* q)
{	
	return (q->rear - q->front + MaxSize) % MaxSize;
}

---

链队

• 链队的数据结构

typedef int ElemType;
typedef struct qnode
{
	ElemType data;
	struct qnode* next;
}DataNode;
typedef struct
{
	DataNode* front;
	DataNode* rear;
}LinkQuNode;

• 初始化队列

void InitQueue(LinkQuNode*& q)
{
	q = new LinkQuNode;
	q->front = q->rear = NULL;
}

• 销毁队列

void DestoryQueue(LinkQuNode* q)
{
	DataNode* pre = q->front, * p;
	if (pre != NULL)
	{
		p = pre->next;
		while (p != NULL)
		{
			delete pre;
			pre = p;
			p = p->next;
		}
		delete pre;
	}
	delete q;
}

• 判断是否为空

bool QueueEmpty(LinkQuNode* q)
{
	return (q->rear == NULL);
}

• 进队列

bool enQueue(LinkQuNode*& q, ElemType e)
{
	DataNode* p = new DataNode;
	p->data = e;
	if (q->rear == NULL)
	{
		q->front = q->rear = p;
	}
	else
	{
		q->rear->next = p;
		q->rear = p;
	}
	return true;
}

• 出队列

bool deQueue(LinkQuNode*& q, ElemType& e)
{
	DataNode* p;
	if (q->rear == NULL)
	{
		return false;
	}
	p = q->front;
	if (q->front == q->rear)
	{
		q->rear = q->front = NULL;
	}
	else
	{
		q->front = q->front->next;
	}
	e = p->data;
	delete p;
	return true;
}