#include<iostream>#include<cstdlib>usingnamespace std;constint maxn =1010;typedefstructnode{int data[maxn];int front , tail;}* link;//初始化voidInit(link que){
que -> front = que -> tail =0;}//入队voidEnter_que(link que ,int x){
que -> data[que -> tail++]= x;}//出队voidDe_que(link que){
cout << que -> data[que -> front++]<<" ";}intGet_front(link que){return que -> data[que -> front];}intGet_size(link que){return que -> tail - que -> front;}intIsempty(link que){return!Get_size(que);}boolIsFull(link que){if(que -> tail >= maxn)returntrue;elsereturnfalse;}intmain(){
link que =(link)malloc(sizeof(node));Init(que);
cout <<"Please enter your data to be pushed , end with -1:"<< endl;while(1){int k =0;
cin >> k;if(k ==-1)break;Enter_que(que , k);}
cout <<Get_front(que)<< endl;int len =Get_size(que);// for(int i = 0 ; i < len ; i++)// De_que(que);while(!Isempty(que))De_que(que);return0;}