05.循环队列的简单操作

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

using namespace std;

#define OK 1
#define ERROR 0
#define OVERFLOW -2

typedef int Status;

#define MAXSIZE 100
typedef int QelemType;
typedef struct {
    QelemType *base;
    int front;
    int rear;
} sqQueue;

//循环队列的初始化
Status InitQuene(sqQueue &Q) {
    Q.base = new QelemType[MAXSIZE];
    if (!Q.base) {
        exit(OVERFLOW);
    }
    Q.front = Q.rear = 0;
    return OK;
}

//入队
Status EnQuene(sqQueue &Q, QelemType e) {
    if ((Q.rear + 1) % MAXSIZE == Q.front) {
        exit(OVERFLOW);
    }
    Q.base[Q.rear] = e;
    Q.rear = (Q.rear + 1) % MAXSIZE;
    return OK;
}

//出队
Status DeQuene(sqQueue &Q, QelemType e) {
    if (Q.rear == Q.front) {
        exit(OVERFLOW);
    }
    e = Q.base[Q.front];
    Q.front = (Q.front + 1) % MAXSIZE;
    return OK;
}

int QueueLength(sqQueue s) {
    return (s.rear - s.front + MAXSIZE) % MAXSIZE;
}

int main() {
    sqQueue Q;
    InitQuene(Q);
    int m, n;
    cout << "输入的次数" << endl;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cout << "要输入的值:";
        cin >> m;
        EnQuene(Q, m);
    }
    m = QueueLength(Q);
    cout << "队列长度为：" << m << endl;
    return 0;
}