循环队列（弥补队列顺序储存的不足）

#include<iostream>
#include<ctime>
using namespace std;

#define MAXSIZE 10
struct quene
{
    int count;
    int number[MAXSIZE];
    int front;
    int end;
};


void inquene(quene *s, int n)//不同于顺序储存
{
    if (s->count == MAXSIZE)
        exit(1);
    s->count++;
    s->end = (s->end + 1) % MAXSIZE;//不同于顺序储存
    s->number[s->end] = n;
}


int dequene(quene *s)//不同于顺序储存
{
    if (s->count != 0)
    {
        s->front = (s->front + 1) % MAXSIZE;
        int t = s->number[s->front];
        return t;
    }
    else return -1;
}



void createquene(quene *s, int x)
{
    srand(time(0));
    if (x > MAXSIZE)
        exit(1);
    else
    {
        for (int i = 1; i <= x; i++)
        {
            inquene(s, rand() % 100 + 1);
            //cout << s->number[i - 1] << endl;
        }
    }
}

void main()
{
    quene *s = new quene;
    s->front = 0;
    s->end = 0;
    s->count = 0;
    createquene(s, 10);
    for (int i = 1; i <= 10; i++)
        cout << dequene(s) << endl;
}