【数据结构】队列(顺序表实现)的基本操作

队列的实现

#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define QUEUE_INIT_SIZE 100
#define OVERFLOW -2

#include <stdio.h>
#include <stdlib.h>

typedef int Status;
typedef int QElemType;

typedef struct
{
    QElemType* base;
    int   front;
    int   rear;
} SqQueue; //顺序表实现队列 非循环队列

Status InitQueue(SqQueue& Q)
{
    Q.base = (QElemType*)malloc(sizeof(QElemType) * QUEUE_INIT_SIZE);
    if (!Q.base) exit(OVERFLOW);
    Q.front = Q.rear = 0;
    return OK;
}

Status EnQueue(SqQueue& Q, QElemType e)
{
    Q.base[Q.rear] = e;
    Q.rear = Q.rear + 1;
    //循环队列
    //Q.rear = (Q.rear + 1)%(QUEUE_INIT_SIZE + 1);
    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) % (QUEUE_INIT_SIZE + 1);
    Q.front = Q.front + 1;

    return OK;
}

Status IsEmpty(SqQueue& Q)
{
    if (Q.front == Q.rear) return TRUE;
    return FALSE;
}

Status GetFront(SqQueue& Q, QElemType& e)
{
    if (Q.front == Q.rear)
        return ERROR;
    e = Q.base[Q.front];
    return OK;
}

void ClearQueue(SqQueue &Q)
{
    free(Q.base);
    Q.base = NULL;
    Q.front = Q.rear;
}


int main()
{
    SqQueue Q;
    InitQueue(Q);
    EnQueue(Q, 1);
    EnQueue(Q, 2);
    EnQueue(Q, 3);
    QElemType e1;
    if (DeQueue(Q, e1) == 1)
    {
        printf("%d\n", e1);
    }

    QElemType e2;
    if (DeQueue(Q, e2) == 1)
    {
        printf("%d\n", e2);
    }

    QElemType e3;
    if (DeQueue(Q, e3) == 1)
    {
        printf("%d\n", e3);
    }

    QElemType e4;
    if (DeQueue(Q, e4) == 1)
    {
        printf("%d\n", e4);
    }

    int e;
    if(GetFront(Q,e) == 1)
    {
        printf("%d", e);
    }

    if(IsEmpty(Q))
    {
        printf("empty!");
    }

    //销毁队列
    ClearQueue(Q);

    return 0;
}