数据结构-顺序队列

#include <iostream>
#include <stdlib.h>
using namespace std;

#define maxSize 20

typedef struct
{
    int data[maxSize];
    int front;
    int rear;
}SqQueue;

void InitQueue(SqQueue &Q)
{
    Q.front=Q.rear=0;
}

int IsEmpty(SqQueue Q)
{
    if(Q.front==Q.rear)
        return 1;
    else
        return 0;
}

int EnQueue(SqQueue &Q,int e)
{
    if((Q.rear+1)%maxSize==Q.front)
        return 0;//队满
    Q.rear=(Q.rear+1)%maxSize;
    Q.data[Q.rear]=e;
    return 1;
}

int DeQueue(SqQueue &Q,int &e)
{
    if(Q.front==Q.rear)
        return 0;
    Q.front=(Q.front+1)%maxSize;
    e=Q.data[Q.front];
    return 1;
}

int Print(SqQueue Q)
{
    if(Q.front==Q.rear)
    {
        cout<<"
队空！
";
        return 0;
    }
    cout<<"队中元素依次为：
";
    while(Q.front!=Q.rear)
    {
        (++Q.front)%maxSize;
        cout<<"  "<<Q.data[Q.front] <<"  ";
    }
    return 1;
}

int main()
{
    int i,e;
    SqQueue Q;
    InitQueue(Q);
    if(IsEmpty(Q)==1)
        cout<<"
队空！
";
    else
        cout<<"
队非空！
";

    cout<<"
---------------------------------
";
    for(i=0;i<10;++i)
        EnQueue(Q,i);
    Print(Q);
    if(IsEmpty(Q)==1)
        cout<<"
队空！
";
    else
        cout<<"
队非空！
";
    cout<<"
---------------------------------
";

    cout<<"依次出队5个元素为：
";
    for(i=0;i<5;++i)
    {
        DeQueue(Q,e);
        cout<<"  "<<e<<"  ";
    }
    cout<<endl;
    Print(Q);
    if(IsEmpty(Q)==1)
        cout<<"
队空！
";
    else
        cout<<"
队非空！
";
    cout<<"
---------------------------------
";

    return 0;
}