队列(顺序存储)

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

#define MAXSIZE 100

//定义结构体
typedef struct
{
    int data[MAXSIZE];
    int len;
    int front;
    int rear;
}SeqQueue;

//初始化队列
SeqQueue *InitQueue(SeqQueue *Q)
{
    Q=(SeqQueue *)malloc(sizeof(SeqQueue));
    Q->front=0,Q->rear=0,Q->len=0;
    return Q;
}

//入队操作
int EnQueue(SeqQueue *Q,int item)
{
    if((Q->rear+1)%MAXSIZE==Q->front)
    {
        printf("Queue is overflow!\n");
        return 0;
    }
    Q->len++;
    Q->data[Q->rear]=item;
    Q->rear=(Q->rear+1)%MAXSIZE;
    return 1;
}

//出队操作
int DeQueue(SeqQueue *Q,int *item)
{
    if(Q->front==Q->rear)
    {
        printf("Queue is empty!\n");
        return 0;
    }
    Q->len--;
    *item=Q->data[Q->front];
    Q->front=(Q->front+1)%MAXSIZE;
    return 1;
}

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

//取队头
int GetHead(SeqQueue *Q)
{
    if(Q->rear==Q->front)
        printf("Queue is empty!\n");
    else
        return Q->data[Q->front];
}

//遍历队列
int QueueTraverse(SeqQueue *Q)
{
    int i;
    if(Q->front==Q->rear)
    {
        printf("Queue is empty!\n");
        return 0;
    }
    for(i=Q->front;i<Q->rear;i++)
    {
        printf("%d ",Q->data[i]);
    }
    printf("\n");
    return 1;
}

//清空队列
int QueueClear(SeqQueue *Q)
{
    int i,j,k;
    j=Q->len;
    for(i=0;i<j;i++)
    {
        DeQueue(Q,&k);
    }
    return 1;
}
int main()
{
    SeqQueue *Q;
    Q=InitQueue(Q);
}