顺序队列【数据结构-朱战立】

//这是一个循环顺序队列的判空、压栈、出栈、取栈顶等操作
#include <stdio.h>

#define MaxSize 100
typedef int bool;
#define T 1
#define F 0

typedef int DataType;
typedef struct queue{
    DataType data[MaxSize];
    int rear;
    int    front;
    int count;
}SeqQueue;

//队列初始化
void SeqQueueInit(SeqQueue *queue)
{
    queue->count = 0;
    queue->front = 0;
    queue->rear = 0;
}

//判断队列非空否
bool SeqQueueNoEmpty(SeqQueue queue)
{
    if (queue.count!=0)   //队列不为空
    {
        return 1;
    }
    else                 //队列为空
    {
        return 0;
    }
}

//进入队列
int SeqQueuePush(SeqQueue *queue, DataType x)
{
    if (queue->count>=MaxSize)
    {
        return 0;
    }
    queue->data[queue->rear]=x;
    queue->rear = (queue->rear + 1) % MaxSize;
    queue->count++;
    return 1;
}

//出队列
int SeqQueuePop(SeqQueue *queue, DataType *x)
{
    if (queue->count==0)
    {
        return 0;
    }
    *x = queue->data[queue->front];
    queue->front = (queue->front + 1) % MaxSize;
    queue->count--;
    return 1;
}

//取出队头
int SeqQueueTop(SeqQueue queue)
{
    if (queue.count==0)
    {
        return 0;
    }
    return queue.data[queue.front];
}

//主函数
int main()
{
    SeqQueue queue;
    int x, i;

    SeqQueueInit(&queue);
    for ( i = 0; i < 15; i++)
    {
        if ((SeqQueuePush(&queue, i)) == 0)
        {
            printf("1error");
            getchar();
            return;
        }
    }
    printf("队头：%d\n", SeqQueueTop(queue));
    while (SeqQueueNoEmpty(queue)!=0)
    {
        if ((SeqQueuePop(&queue, &x)) == 0)
        {
            printf("2error");
            getchar();
            return;
        }
        else
        {
            printf("%d     ", x);
        }
    }
    getchar();
    return 0;
}