// 链队列及其操作实现.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
typedef struct QNode
{
int data;
struct QNode *next;
}QNode, *Queueptr;
typedef struct
{
Queueptr front;
Queueptr rear;
}LinkQueue;
//函数声明
void Error(char *s); //错误处理函数
LinkQueue Creat_qnode(); //创建一个链队列
void Destroy_qnode(LinkQueue &q); //销毁以创建好的链队列
void Clear_qnode(LinkQueue &q); //清除以创建好的链队列
int Getlength_qnode(LinkQueue &q); //得到链队列的长度
void Gethead_qnode(LinkQueue &q, int e); //取链队列的队首元素
void En_qnode(LinkQueue &q, int e); //入队函数
void De_qnode(LinkQueue &q, int e); //出队函数,单个出队函数
void Print_qnode(LinkQueue &q); //显示输出函数,所有的都出队
//函数定义
void Error(char *s)
{
cout << s << endl;
exit(1);
}
LinkQueue Creat_qnode()
{
LinkQueue q;
q.front = q.rear = new QNode;
q.front->next = NULL;
int length = 0;
int number = 0;
cout << "请输入链队列的长度:";
cin >> length;
cout << "请输入链队列的数据:";
for (int i = 0; i < length; i++)
{
LinkQueue p;
p.rear = new QNode;
if (!p.rear)
Error("内存分配失败!");
cin >> number;
p.rear->data = number;
p.rear->next = NULL;
q.rear->next = p.rear;
q.rear = p.rear;
}
return q;
}
void Destroy_qnode(LinkQueue &q)
{
while (q.front)
{
q.rear = q.front->next;
delete q.front;
q.front = q.rear;
}
}
void Clear_qnode(LinkQueue &q)
{
LinkQueue *p = NULL;
p->front = q.front->next;
while (p->front)
{
q.front = p->front;
p->front = p->front->next;
delete q.front;
}
q.front->next = NULL;
q.rear = q.front;
}
int Getlength_qnode(LinkQueue &q)
{
QNode *p = NULL;
p = q.front;
int length = 0;
while (p->next != NULL)
{
length++;
p = p->next;
}
return length;
}
void Gethead_qnode(LinkQueue &q,int e)
{
if (q.front->next == NULL)
Error("该队列为空!");
e = q.front->next->data;
cout << "该队列的队首元素是:" << e << endl;
}
void En_qnode(LinkQueue &q, int e)
{
LinkQueue p;
p.rear = new QNode;
if (!p.rear)
Error("内存分配失败!");
p.rear->data = e;
p.rear->next = NULL;
q.rear->next = p.rear;
q.rear = p.rear;
}
void De_qnode(LinkQueue &q, int e)
{
if (q.front->next==NULL)
Error("该队列为空!");
QNode *p = NULL;
p=q.front->next;
e = p->data;
cout << e << endl;
q.front->next = p->next;
if (q.rear == p)
q.rear = q.front;
delete p;
}
void Print_qnode(LinkQueue &q)
{
int e = 0;
while (q.front->next!=NULL)
{
QNode *p = NULL;
p = q.front->next;
e = p->data;
cout << e << " ";
q.front->next = p->next;
if (q.rear == p)
q.rear = q.front;
}
cout << endl;
}
int _tmain(int argc, _TCHAR* argv[])
{
LinkQueue Q;
Q = Creat_qnode();
int e = 0;
cout << "该循环队列的长度是:" << Getlength_qnode(Q) << endl;
Gethead_qnode(Q, e);
cout << "请输入要入队的元素:";
cin >> e;
En_qnode(Q, e);
cout << "现该队列的队首元素是:";
De_qnode(Q, e);
Print_qnode(Q);
return 0;
}
c语言:链队列的实现
最新推荐文章于 2022-11-27 14:02:38 发布