C++ 数据结构算法 学习笔记(8) - 队列及企业级应用 (续1)

C++ 数据结构算法 学习笔记(8) - 队列及企业级应用 (续1)

链式存储

队列的链式存储结构，其实就是线性表的单链表，只不过它只是尾进头出而已，我们把它简称为链队列。为了 操作上的方便，我们将队头指针指向链队列的头结点，而队尾指针指向终端节点

#define MaxSize 5
typedef int DataType;

typedef struct _QNode
{
	DataType data;
	struct _QNode* next;
}QNode;

typedef QNode* QueuePtr;

typedef struct Queue
{
	int length;
	QueuePtr front;
	QueuePtr rear;

}LinkQueue;

链式队列操作图示

空队列时，front 和 rear 都指向空。

删除节点

完整代码

#include <iostream>
#include <string>
#include <iomanip>

using namespace std;

#define MaxSize 5
typedef int DataType;

typedef struct _QNode
{
	DataType data;
	struct _QNode* next;
}QNode;

typedef QNode* QueuePtr;

typedef struct Queue
{
	int length;
	QueuePtr front;
	QueuePtr rear;

}LinkQueue;

void InitQueue(LinkQueue* LQ)
{
	if (!LQ) return;
	LQ->length = 0;
	LQ->front = LQ->rear = NULL;
}

int IsEmpty(LinkQueue* LQ)
{
	if (!LQ) return 0;
	if (LQ->front == NULL)
	{
		return 1;
	}
	return 0;
}

int IsFull(LinkQueue* LQ)
{
	if (!LQ)return 0;
	if (LQ->length == MaxSize)
	{
		return 1;
	}
	return 0;
}

int EnterQueue(LinkQueue* LQ, DataType data)
{
	if (!LQ) return 0;

	if (IsFull(LQ))
	{
		cout << "Not able to insert the element, the queue is FULL" << endl;
		return 0;
	}

	QNode* qNode = new QNode;
	qNode->data = data;
	qNode->next = NULL;

	if (IsEmpty(LQ))
	{
		LQ->front = LQ->rear = qNode;
	}
	else
	{
		LQ->rear->next = qNode;
		LQ->rear = qNode;
	}
	LQ->length++;
	return 1;
}

int GetHead(LinkQueue* LQ, DataType* data)
{
	if (!LQ || IsEmpty(LQ))
	{
		cout << "The Queue is NULL" << endl;
		return 0;
	}
	if (!data) return 0;
	*data = LQ->front->data;
	return 1;

}

void ClearQueue(LinkQueue* LQ)
{
	if (!LQ) return;
	cout << "Clearning the Queue" << endl;
	while (LQ->front)
	{
		QueuePtr tmp = LQ->front->next;
		delete LQ->front;
		LQ->front = tmp;
	}
	LQ->front = LQ->rear = 0;
	LQ->length = 0;
}

int getLength(LinkQueue* LQ)
{
	if (!LQ) return 0;
	return LQ->length;
}
int DeleteQueue(LinkQueue* LQ, DataType* data)
{
	QNode* tmp = NULL;

	if (!LQ || IsEmpty(LQ))
	{
		cout << "The Queue is NULL" << endl;
		return 0;
	}

	if (!data) return 0;
	tmp = LQ->front;

	LQ->front = tmp->next;
	if (!LQ->front)LQ->rear = NULL;
	*data = tmp->data;
	LQ->length--;
	delete tmp;
	return 1;
}

void PrintQueue(LinkQueue* LQ)
{
	QueuePtr tmp;
	if (!LQ) return;

	if (LQ->front == NULL)
	{
		cout << "This is a empty queue" << endl;
		return;
	}
	tmp = LQ->front;
	while (tmp)
	{
		cout << setw(4) << tmp->data;
		tmp = tmp->next;
	}
	cout << endl;
}

int main()
{
	LinkQueue* LQ = new LinkQueue;
	DataType data = -1;
	//1. Initiallized the Queue List
	InitQueue(LQ);

	for (int i = 0; i < 7; i++)
	{	
		EnterQueue(LQ, i);
	}

	//2. Printout the queue element
	cout << "The total element left in the queue is " << getLength(LQ) << endl;
	PrintQueue(LQ);
	cout << endl;


	//3. Remove the element from the queue
	if (DeleteQueue(LQ, &data))
	{
		cout << "the element remove is" << data << endl;
	}
	else
	{
		cout << "failed to remove" << endl;
	}

	//Printing the element in the queue
	cout << "The length of the queue is" << getLength(LQ) << endl;
	PrintQueue(LQ);
	cout << endl;

	ClearQueue(LQ);
	PrintQueue(LQ);
	delete LQ;
	system("pause");
	return 0;
}