数据结构第三章栈与队列：循环队列

//数据结构 第三章栈与队列 循环队列
//2021.8.14
//by Walnut from NWU
/*
* 队列：允许插入为队尾，允许删除为队头
* 先进先出表FIFO
* 操作：初始化，判空，判满，入队，出队，读队头，清空
* 本例中为区分队满与队空，牺牲了一个存储区域
*/
#include<iostream>
#include<stack>
#include<cmath>
#define MAXSIZE 15
using namespace std;

typedef struct SeqQueue {//循环队列结构体
    int data[MAXSIZE];
    int front;//指向队头
    int rear;//指向队尾+1
};

void initQueue(SeqQueue* s) {//队列初始化
    for (int i = 0; i < MAXSIZE; i++) {
        s->data[i] = 0;
    }
    s->front = 0;
    s->rear = 0;
}

bool enterQueue(SeqQueue* s, int n) {//入列
    if ((s->rear + 1) % MAXSIZE == s->front)//队列满，牺牲了一个存储空间用于区分满与空
        return false;
    s->data[s->rear] = n;
    s->rear = (s->rear + 1) % MAXSIZE;//%用于循环队列定位
    return true;
}

bool deleteQueue(SeqQueue* s, int* n) {//出列
    if (s->front == s->rear)
        return false;
    *n = s->data[s->front];
    s->front = (s->front + 1) % MAXSIZE;
    return true;
}

void coutQueue(SeqQueue s) {//输出队列，区分队头与队尾指针大小关系
    if (s.front <= s.rear) {
        cout << "Queue: ";
        for (int i = s.front; i < s.rear; i++) {
            cout << s.data[i] << " ";
        }
        cout << endl;
    }
    else {
        cout << "Queue: ";
        for (int i = s.front; i < MAXSIZE; i++) {
            cout << s.data[i] << " ";
        }
        for (int i = 0; i < s.rear; i++) {
            cout << s.data[i] << " ";
        }
        cout << endl;
    }
}

int main() {
    SeqQueue s;
    initQueue(&s);
    for (int i = 0; i < 11; i++) {
        enterQueue(&s, i);
    }
    coutQueue(s);
    for (int i = 0; i < 5; i++) {
        int n = 0;
        deleteQueue(&s, &n);
        cout << "delete:" << n << endl;
    }
    coutQueue(s);
    for (int i = 0; i < 11; i++) {
        enterQueue(&s, i);
    }
    coutQueue(s);
    for (int i = 0; i < 5; i++) {
        int n = 0;
        deleteQueue(&s, &n);
        cout << "delete:" << n << endl;
    }
    coutQueue(s);
    return 0;
}

//数据结构 第三章栈与队列 循环队列
//2021.8.14
//by Walnut from NWU
/*
* 队列：允许插入为队尾，允许删除为队头
* 先进先出表FIFO
* 操作：初始化，判空，判满，入队，出队，读队头，清空
* 本例中为区分队满与队空，设置一个tag位
*/
#include<iostream>
#include<stack>
#include<cmath>
#define MAXSIZE 15
using namespace std;

typedef struct SeqQueue {//循环队列结构体
    int data[MAXSIZE];
    int front;//指向队头
    int rear;//指向队尾+1
    int tag;//满空区分，1满0未满
};

void initQueue(SeqQueue* s) {//队列初始化
    for (int i = 0; i < MAXSIZE; i++) {
        s->data[i] = 0;
    }
    s->front = 0;
    s->rear = 0;
    s->tag = 0;
}

bool enterQueue(SeqQueue* s, int n) {//入列
    if (s->front==s->rear&&s->tag==1)//队列满
        return false;
    if ((s->rear + 1) % MAXSIZE == s->front) {//若还剩一个空间设置标志位为1满
        s->tag = 1;
    }
    else {//剩余空间大于1，设置标志位为0未满
        s->tag = 0;
    }
    s->data[s->rear] = n;
    s->rear = (s->rear + 1) % MAXSIZE;//%用于循环队列定位
    return true;
}

bool deleteQueue(SeqQueue* s, int* n) {//出列
    if (s->front == s->rear && s->tag == 0)//若空返回失败
        return false;
    if ((s->front + 1) % MAXSIZE == s->rear) {//若队列中仅剩余一个数，设置标志位0未满
        s->tag = 0;
    }
    else {//设置标志位满，注意此时并非真正满，这里设置为1是为了区分于标志位为0，判断真正满还需判定front==rear
        s->tag = 1;
    }
    *n = s->data[s->front];
    s->front = (s->front + 1) % MAXSIZE;
    return true;
}

void coutQueue(SeqQueue s) {//输出队列，区分队头与队尾指针大小关系
    if (s.front < s.rear) {
        cout << "Queue: ";
        for (int i = s.front; i < s.rear; i++) {
            cout << s.data[i] << " ";
        }
        cout << endl;
    }
    else {
        cout << "Queue: ";
        for (int i = s.front; i < MAXSIZE; i++) {
            cout << s.data[i] << " ";
        }
        for (int i = 0; i < s.rear; i++) {
            cout << s.data[i] << " ";
        }
        cout << endl;
    }
}

int main() {
    SeqQueue s;
    initQueue(&s);
    for (int i = 0; i < 11; i++) {
        enterQueue(&s, i);
    }
    coutQueue(s);
    for (int i = 0; i < 5; i++) {
        int n = 0;
        deleteQueue(&s, &n);
        cout << "delete:" << n << endl;
    }
    coutQueue(s);
    for (int i = 0; i < 11; i++) {
        enterQueue(&s, i);
    }
    coutQueue(s);
    for (int i = 0; i < 5; i++) {
        int n = 0;
        deleteQueue(&s, &n);
        cout << "delete:" << n << endl;
    }
    coutQueue(s);
    return 0;
}