2021-07-29

顺序队列的基本函数

/*
 * @Description: 顺序队列的基本函数
 * @Version: 
 * @Autor: Lizn
 * @Date: 2021-07-29 10:37:31
 * @LastEditors: Lizn
 * @LastEditTime: 2021-07-29 11:08:56
 */

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

#define MaxSize 7
typedef int ElemType;

/**
 * @description: 定义顺序队列的结构体
 * @param {*}
 * @return {*}
 * @author: Lizn
 */
typedef struct 
{
    ElemType data[MaxSize];
    int front,rear; 
} SqQueue; 

/**
 * @description: 
 * @param {*}
 * @return {*}
 * @author: Lizn
 */
SqQueue InitQueue()
{
    SqQueue Q;                //队头和队尾相等即为空队列 
    Q.front = Q.rear = 0;
    return Q;
}

/**
 * @description: 判断队空
 * @param {SqQueue} Q 主体队列
 * @return {*}
 * @author: Lizn
 */
int IsEmpty(SqQueue Q){
    if(Q.rear == Q.front) return 1; //队空条件
    else return 0;
}
/**
 * @description: 入队列
 * @param {SqQueue} &Q 队列主体
 * @param {ElemType} x 队列值
 * @return {*}
 * @author: Lizn
 */
void EnQueue(SqQueue &Q,ElemType x)
{
    if( (Q.rear+1) % MaxSize == Q.front )//入队必须判断队列是否满了 
        printf("Queue full\n"); 
    Q.data[Q.rear] = x;
    Q.rear = (Q.rear+1) % MaxSize; //队尾指针加1取模

}

/**
 * @description: 
 * @param {SqQueue} &Q
 * @return {*}
 * @author: Lizn
 */
ElemType DeQueue(SqQueue &Q)
{
    if(Q.rear == Q.front)            //出队列时候必须判断队列是否为空 
        printf("Queue empty\n");
    ElemType x = Q.data[Q.front];
    Q.front = (Q.front+1) % MaxSize;
    return x;
}