队列学习-单链表队列
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;
2. 单链表队列初始化
void InitQueue(LinkQueue *LQ) {
if (!LQ) return;
LQ->length = 0;
LQ->front = LQ->rear = NULL;
}
3. 判断单链表队列是否为空
int IsEmpty(LinkQueue *LQ) {
if (!LQ) return 0;
if (LQ->front == NULL) {
return 1;
}
return 0;
}
4. 判断单链表队列是否为满
int IsFull(LinkQueue *LQ) {
if (!LQ) return 0;
if (LQ->length == MAXSIZE) {
return 1;
}
return 0;
}
5. 入队
int EnterQueue(LinkQueue *LQ, DataType data) {
if (!LQ) return 0;
if (IsFull(LQ)) {
cout << "无法插入元素" << data << ",队列已满!" << 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;
}
6. 出队
int DeleteQueue(LinkQueue *LQ, DataType *data) {
QNode *tmp = NULL;
if (!LQ || IsEmpty(LQ)) {
cout << "队列为空!" << 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;
}
7. 打印单链表队列中的全部元素
void PrintQueue(LinkQueue *LQ) {
QueuePtr tmp;
if (!LQ) return;
if (LQ->front == NULL) {
cout << "队列为空!\n";
return;
}
tmp = LQ->front;
while (tmp) {
cout << setw(4) << tmp->data;
tmp = tmp->next;
}
cout << endl;
}
8. 获取单链表队列首元素,不出队
int GetHead(LinkQueue *LQ, DataType *data) {
if (!LQ || IsEmpty(LQ)) {
cout << "队列为空!" << endl;
return 0;
}
if (!data) return 0;
*data = LQ->front->data;
return 1;
}
9. 清空单链表队列,释放内存资源
void ClearQueue(LinkQueue *LQ) {
if (!LQ) return;
while (LQ->front) {
QueuePtr tmp = LQ->front->next;
delete LQ->front;
LQ->front = tmp;
}
LQ->front = LQ->rear = NULL;
LQ->length = 0;
}
10. 获取单链表队列中的数据总个数
int getLength(LinkQueue *LQ) {
if (!LQ) return 0;
return LQ->length;
}
11. 测试代码
int main(void) {
LinkQueue *LQ = new LinkQueue;
DataType data = -1;
InitQueue(LQ);
for (int i = 0; i < 7; i++) {
EnterQueue(LQ, i);
}
cout << "队列中的元素(总共" << getLength(LQ) << "个): " << endl;
PrintQueue(LQ);
cout << endl;
if (DeleteQueue(LQ, &data)) {
cout << "出队的元素是: " << data << endl;
}
else {
cout << "出队失败!" << endl;
}
cout << "出队一个元素后, 队列中的剩下的元素[" << getLength(LQ) << "]: " << endl;
PrintQueue(LQ);
cout << endl;
ClearQueue(LQ);
cout << "清空队列!\n";
PrintQueue(LQ);
system("pause");
return 0;
}
12. 运行结果
12. 完整代码
#include <iostream>
#include <stdio.h>
#include <assert.h>
#include <iomanip>
#include <Windows.h>
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 << "无法插入元素" << data << ",队列已满!" << 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 DeleteQueue(LinkQueue *LQ, DataType *data) {
QNode *tmp = NULL;
if (!LQ || IsEmpty(LQ)) {
cout << "队列为空!" << 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 << "队列为空!\n";
return;
}
tmp = LQ->front;
while (tmp) {
cout << setw(4) << tmp->data;
tmp = tmp->next;
}
cout << endl;
}
int GetHead(LinkQueue *LQ, DataType *data) {
if (!LQ || IsEmpty(LQ)) {
cout << "队列为空!" << endl;
return 0;
}
if (!data) return 0;
*data = LQ->front->data;
return 1;
}
void ClearQueue(LinkQueue *LQ) {
if (!LQ) return;
while (LQ->front) {
QueuePtr tmp = LQ->front->next;
delete LQ->front;
LQ->front = tmp;
}
LQ->front = LQ->rear = NULL;
LQ->length = 0;
}
int getLength(LinkQueue *LQ) {
if (!LQ) return 0;
return LQ->length;
}
int main(void) {
LinkQueue *LQ = new LinkQueue;
DataType data = -1;
InitQueue(LQ);
for (int i = 0; i < 7; i++) {
EnterQueue(LQ, i);
}
cout << "队列中的元素(总共" << getLength(LQ) << "个): " << endl;
PrintQueue(LQ);
cout << endl;
if (DeleteQueue(LQ, &data)) {
cout << "出队的元素是: " << data << endl;
}
else {
cout << "出队失败!" << endl;
}
cout << "出队一个元素后, 队列中的剩下的元素[" << getLength(LQ) << "]: " << endl;
PrintQueue(LQ);
cout << endl;
ClearQueue(LQ);
cout << "清空队列!\n";
PrintQueue(LQ);
system("pause");
return 0;
}