#include <iostream>
using namespace std;
#include <stdio.h>
#include <stdlib.h>
#define maxsize 100
typedef char QElemType;
typedef struct
{
QElemType* base;
int front;
int rear;
}SeqQueue;
//SeqQueue* Q;
void InitQueue(SeqQueue &Q)
{
Q.base=(QElemType*)malloc(sizeof(QElemType));
Q.front=Q.rear=maxsize-1;
cout<<"初始化成功!"<<endl;
}
void EnQueue(SeqQueue &Q,QElemType x)
{
if((Q.rear+1)%maxsize==Q.front)
{
cout<<"overflow";
}
else
{
Q.base[Q.rear]=x;
Q.rear=(Q.rear+1)%maxsize;
cout<<"插入成功!\n";
}
}
void DlQueue(SeqQueue &Q)
{
if(Q.rear==Q.front)
{
cout<<"队列为空!";
}
else
{
Q.front=(Q.front+1)%maxsize;
cout<<"删除成功!\n";
}
}
void GETHEAD(SeqQueue &Q)
{
if(Q.rear==Q.front)
{
cout<<"队列为空!";
}
else{
cout<<"队头元素为:"<<Q.base[(Q.front+1)%maxsize];
}
}
int main()
{
int i,j=1;
QElemType x;
SeqQueue Q;
while(j)
{
cout<<"\n"<<endl;
cout<<"****************************************************************"<<endl;
cout<<"*** 菜单： ***"<<endl;
cout<<"*** 1.初始化对列 2.插入元素 3.删除元素 ***"<<endl;
cout<<"*** 4.取头元素 5.退出 ***"<<endl;
cout<<"****************************************************************"<<endl;
cout<<"请选择您所希望的操作：";
cin>>i;
if(i==1)
{
InitQueue(Q);
}
else if(i==2)
{
cout<<"请输入要插入的元素:";
cin>>x;
EnQueue(Q,x);
}
else if(i==3)
{
DlQueue(Q);
}
else if(i==4)
{
GETHEAD(Q);
}
else if(i==5)
{
j=0;
cout<<"程序结束\n";
}
}
}
