#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 110;
//循环队列
int main()
{
int q[N], front = 0, rear = -1;//front 指向第一个元素,rear指向最后一个元素
//队列为空
front == (rear+1)%N;
//队列满
front = (rear + 2) % N;
//插入
q[++rear] = 1;
rear %= N;
//弹出
front = (front + 1) % N;
//返回队头
q[front];
return 0;
}
09-23
10-26