#define _CRT_SECURE_NO_WARNINGS

#include<stdio.h>
#include<malloc.h>

#define Maxsize 50

typedef int Elemtype;

typedef struct
{
    Elemtype data[Maxsize];
    int front, rear;

}Sq;


//队列的顺序存储
//初始化 q -> front = q -> rear =-1;
//队空的条件是 q -> rear == q ->front
//队满的条件是 q -> rear == Maxsize - 1
//进栈的操作 q -> rear ++;q ->data[q ->rear] = e;
//出栈的操作 q -> front ++; e =q ->data[q ->front];

//初始化队列
void Initqueue(Sq*& q)
{
    q = (Sq*)malloc(sizeof(Sq));
    q->front = q->rear = -1;
}

//进队
bool enqueue(Sq*& q, Elemtype e)
{
    if (q->rear == Maxsize - 1)
    {
        return false;
    }
    q->rear++;
    q->data[q->rear] = e;
    return true;
}
//出队
bool dequeue(Sq*& q, Elemtype& e)
{
    if (q->front == q->rear)
    {
        return false;
    }
    q->front++;
    e = q->data[q->front];

    return true;
}




//循环队列
//初始化  q ->front = q -> rear = 0;
// 判断队空的条件是  q ->rear == q -> front
// 判断队满的条件是  (q ->rear + 1) %Maxsize == q -> front 
//进栈时：队头指针 front 循坏加一  q ->front = (q ->front + 1) % Maxsize;
//出站时：队尾指针 rear 循环加一  q ->rear = (q -> rear + 1) % Maxsize;

//初始化队列
void Initqueue(Sq*& q)
{
    q = (Sq*)malloc(sizeof(Sq));

    q->front = q->rear = 0; //循环队列初始化指针指向零；
}

// 进队
bool enqueue(Sq*& q, Elemtype e)
{
    if ((q->rear + 1) % Maxsize == q->front) //堆满操作的判断，需要空出一个空间来存放队头指针
    {
        return false;
    }
    q->rear = (q->rear + 1) % Maxsize;
    q->data[q->rear] = e;
    return true;
}

//出队
bool dequeue(Sq*& q, Elemtype& e)
{
    if (q->front == q->rear)
    {
        return false;
    }
    q->front = (q ->front + 1) % Maxsize;
    e = q->data[q->front];
    return true;
}