顺序队列与循环队列

顺序队列定义

#define maxsize 50
typedef struct{
    int data[maxsize];
    int front,rear;
}SqQueue;

循环队列

#include <stdio.h>

//循环队列
#define maxsize 100

typedef struct
{
    int data[maxsize];
    int front;//队头指针
    int rear;//队尾指针
}SqQueue;

//初始化队列
void InitQueue(SqQueue &Q)
{
    Q.front = 0;
    Q.rear = 0;
}

//入队列
bool EnQueue(SqQueue &Q, int e)
{
    if ((Q.rear + 1) % maxsize == Q.front)//判断是否队满
        return false;
    
    Q.data[Q.rear] = e;//赋值给队尾
    Q.rear = (Q.rear + 1) % maxsize;//rear指针后移一个位置
    return true;
}

//出队列
bool DeQueue(SqQueue &Q, int e)
{
    if (Q.front == Q.rear)//判断是否队空
        return false;
        
    e = Q.data[Q.front]; //队头元素赋值给e
    Q.front = (Q.front + 1) % maxsize;//front指针后移一个位置
    return true;
}

//判断队列是否为空
int IsEmpty(SqQueue &Q)
{
    if (Q.front == Q.rear)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}

//判断队列是否满
int IsFull(SqQueue &Q)
{
    if ((Q.rear + 1) % maxsize == Q.front)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}

int QueueLength(SqQueue &Q)
{
    return (Q.rear - Q.front + maxsize) % maxsize;
}

//输出队列
void PrintQueue(SqQueue &Q)
{
    int i;
    for (i = Q.front;i != Q.rear; i++)
    {
        printf("%d ", Q.data[i]);
        if(i == maxsize - 1)
        {
            i = 0;
        }
    }
    printf("\n");
}

int main()
{
    SqQueue Q;
    InitQueue(Q);
    int n;
    printf("请输入队列长度：");
    scanf("%d", &n);
    int arr[n];
    for(int i = 0;i<n;i++)
    {
        printf("请输入第%d个元素：",i+1);
        scanf("%d",&arr[i]);
        EnQueue(Q,arr[i]);
    }
    PrintQueue(Q);

    DeQueue(Q,n);
    PrintQueue(Q);
}