循环队列
Description
#include<bits/stdc++.h>using namespace std;
const int Max_size=100000;
int a[Max_size+1];
int tail=1,head=1;
void push(int value){
a[(tail++)%Max_size]=value;
}
void pop(){
(head++)%Max_size;
}
bool empty(){
return head==tail;
}
bool full(){
return (tail+1)%Max_size==head;
}
int size(){
return (tail+Max_size-head)%Max_size;
}
int main(){
return 0;
}
