1.完整代码
#include<iostream>
using namespace std;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define MAXQSIZE 100
typedef int QElemType;
typedef int Status;
typedef struct{
QElemType *base;
int front;
int rear;
}SqQueue;
Status InitQueue(SqQueue &Q)
{
Q.base = new QElemType[MAXQSIZE];
if ( !Q.base )
exit(OVERFLOW);
Q.front = Q.rear = 0;
return OK;
}
int QueueLength(SqQueue Q)
{
return(Q.rear - Q.front + MAXQSIZE) / MAXQSIZE;
}
Status EnQueue(SqQueue &Q, QElemType e)
{
if ((Q.rear + 1) % MAXQSIZE == Q.front)
return ERROR;
Q.base[Q.rear] = e;
Q.rear = (Q.rear + 1) % MAXQSIZE;
return OK;
}
Status DeQueue(SqQueue &Q, QElemType &e)
{
if ( Q.front == Q.rear)
return ERROR;
e = Q.base[Q.front];
Q.front = (Q.front + 1) % MAXQSIZE;
}
Status GetHead(SqQueue Q)
{
if ( Q.front != Q.rear )
return Q.base[Q.front];
}
void Enter_To_Queue(SqQueue &Q)
{
int n;
QElemType e;
int flag;
printf("请输入入队元素个数(>=1): \n");
scanf("%d",&n);
for(int i=0; i<n; i++)
{
printf("请输入第%d个元素的值: ",i+1);
scanf("%d",&e);
flag=EnQueue(Q,e);
if(flag)
printf("%d已入队\n",e);
else
{
printf("队已满!!!\n");
break;
}
}
}
void Delete_From_Queue(SqQueue &Q)
{
int n;
QElemType e;
int flag;
printf("请输入出队元素个数(>=1): \n");
scanf("%d",&n);
for(int i=0;i<n;i++)
{
flag=DeQueue(Q,e);
if(flag)
printf("%d已出队\n",e);
else
{
printf("队已空!!!\n");
break;
}
}
}
void Get_Head_Of_Queue(SqQueue Q)
{
QElemType e;
bool flag;
flag = GetHead(Q);
if(flag)
printf("队头元素为:%d\n",flag);
else
printf("队已空!!!\n");
}
int main()
{
SqQueue Q;
InitQueue(Q);
Enter_To_Queue(Q);
printf("\n");
Get_Head_Of_Queue(Q);
printf("\n");
Delete_From_Queue(Q);
return 0;
}
2.测试结果