本文主要是介绍队列顺序结构C/C++实现(数据结构严蔚敏版),希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
1、头文件Queue.h
#include<iostream>
using namespace std;//定义4个空间,留出一个作为标志位,当Q.rear+1 / MAXQSIZE = Q.front时,说明队列已满#define MAXQSIZE 4
#define ok 1
#define error 0
#define flow 0typedef int ElemType;
typedef int Status;//定义数据类型
typedef struct{ElemType *base;int front;int rear;}SqQueue;//初始化队列
Status InitQueue(SqQueue& Q)
{Q.base = new ElemType[MAXQSIZE];if(!Q.base) exit(flow);Q.front = Q.rear = 0;return ok;
}//获取队列长度
int QueueLength(const SqQueue& Q){return ( Q.rear - Q.front+MAXQSIZE ) % MAXQSIZE;
}//删除队列的头,并返回删除的数据
Status DeQueue(SqQueue& Q, ElemType& e){if(Q.front == Q.rear)return error;Q.front = (Q.front + 1) % MAXQSIZE;return ok;
}//在队尾进行插入
Status EnQueue(SqQueue& Q, ElemType e)
{//插入到队尾if((Q.rear + 1) % MAXQSIZE == Q.front){cout<<"队列已满\n\n"<<endl;return error;}Q.base[Q.rear] = e;Q.rear = (Q.rear+1) % MAXQSIZE;return ok;
}//打印队列
Status Print(const SqQueue& Q){int a = Q.front;if(Q.front == Q.rear){cout<<"这是个空队列\n\n"<<endl;return error;}else{while(Q.rear != a){cout<<Q.base[a]<<" ";a++;}cout<<endl;return ok;}} //判断队列是否已满
Status IsFull(SqQueue& Q){if(Q.front == (Q.rear+1) % MAXQSIZE){cout<<"队列已满,请先删除再添加\n\n"<<endl;return error;} else{return ok;}}
2、测试文件test.cpp:
#include "Queue.h"int main(void)
{SqQueue Q;ElemType e;int n;InitQueue(Q);cout<<" 0------退出"<<endl;cout<<" 1------插入队列"<<endl;cout<<" 2------删除队列的首部"<<endl;cout<<" 3------队列的长度"<<endl; cout<<" 4------队列的数据如下"<<endl; cout<<"请输入你的操作"<<endl;cin>>n;while(1){switch(n){case 0:delete(Q.base); exit(flow);case 1:cout<<"输入一个数据"<<endl;if(IsFull(Q)){cin>>e;EnQueue(Q, e);cout<<endl;}break;case 2:DeQueue(Q, e);cout<<"删除的队首数据是:"<<e<<endl;cout<<endl;break;case 3:cout<<"队列的长度是:"<<QueueLength(Q);cout<<endl<<endl;break;case 4:cout<<"队列如下:"<<endl;Print(Q);break;}cout<<" 0------退出"<<endl;cout<<" 1------插入队列"<<endl;cout<<" 2------删除队列的首部"<<endl;cout<<" 3------队列的长度"<<endl; cout<<" 4------队列的数据如下"<<endl; cout<<"请输入你的操作"<<endl;cin>>n;cout<<"\n\n";}}
这篇关于队列顺序结构C/C++实现(数据结构严蔚敏版)的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!