顺序队实现

#include<stdio.h>
#include<malloc.h>
#define ERROR 0
#define OK 1
#define MAXQSIZE 20
typedef  int QElemType;
typedef struct
{
    QElemType *base;
    int front;
    int rear;
}SqQueue;

//
int InitQueue(SqQueue *Q)
{
   Q->base=(QElemType*)malloc(MAXQSIZE*sizeof(QElemType));
   if(!Q->base)
          return 0;
   Q->front=Q->rear=0;
   return 1;
}

//求队长
int QueueLength(SqQueue *Q)
{
return (Q->rear-Q->front+MAXQSIZE)%MAXQSIZE;
}
//入队
int EnQueue(SqQueue *Q,QElemType e)
{
    if((Q->rear+1)%MAXQSIZE==Q->front)
          return 0;
Q->base[Q->rear]=e;
Q->rear=(Q->rear+1)%MAXQSIZE;
return 1;
}

//出队
int DeQueue(SqQueue *Q,QElemType *e)
{
    if(Q->front==Q->rear)return 0;
    *e=Q->base[Q->front];
    Q->front=(Q->front+1)%MAXQSIZE;
    return 1;
}

//判队空
int QueueEmpty(SqQueue *Q)
{
    if(Q->front==Q->rear)
          return 1;
    else
          return 0;
}

//取队头
int GetHead(SqQueue *Q,QElemType *e)
{
    if(Q->front==Q->rear)
        return ERROR;
    *e=Q->base[Q->front];
    return OK;
}

//销毁队列
int DestroyQueue(SqQueue *Q)
{
    if(Q->base)
    {
        Q->rear=Q->front=0;
        free(Q->base);
    }
    return OK;
}

int main()
{
    SqQueue q;
    int e;
    InitQueue(&q);
  while(scanf("%d",&e)==1)
       {
           if(e)
           {
               EnQueue(&q,e);
           }else
           {
               if(QueueEmpty(&q))
               {
                   printf("error");
                   return 0;
               }else
               {
                   DeQueue(&q,&e);
               }
           }
       }
       if(QueueLength(&q))
       {
           while(!QueueEmpty(&q))
           {
               DeQueue(&q,&e);
               printf("%d ",e);
           }
       }else
       {
           printf("empty");
       }
    return 0;
}