数组队列

#ifndef _ARRAY_QUEUE_H_
#define _ARRAY_QUEUE_H_

#define MAX_ARRAY_SIZE  100

#define QElemType int

typedef struct {
        QElemType *base;
        int front;
        int rear;
}SqQueue;

int initQueue(SqQueue *Q);

int queueLength(SqQueue *Q);

int enQueue(SqQueue *Q,QElemType e); 

int deQueue(SqQueue *Q,QElemType *e);

int destoryQueue(SqQueue *Q);                                                                                             

#endif

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

#include "array_queue.h"

int initQueue(SqQueue *Q){

        Q->base = (QElemType *)malloc(sizeof(QElemType) * MAX_ARRAY_SIZE);

        if(!(Q->base))
                return -1;

        Q->front = Q->rear = 0;

        return 0;
}

int destoryQueue(SqQueue *Q){

        if(Q->base)
                free(Q->base);

        return 0;
}

int queueLength(SqQueue *Q){

        return(Q->rear - Q->front + MAX_ARRAY_SIZE) % MAX_ARRAY_SIZE;
}


int enQueue(SqQueue *Q,QElemType e){

        if( (Q->rear + 1) % MAX_ARRAY_SIZE == Q->front )
                return -1;

        Q->base[Q->rear] = e;
        Q->rear = (Q->rear + 1) % MAX_ARRAY_SIZE;

        return 0;
}

int deQueue(SqQueue *Q,QElemType *e){

        if(Q->front == Q->rear)
                return -1;

        *e = Q->base[Q->front];

        Q->front = (Q->front + 1) % MAX_ARRAY_SIZE;

        return 0;
}