#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define ture 1
#define false 0
#define max 5
typedef struct {
	int data[max];
	int front,rear;
}cteam,*team;
static int num=0;  //全局變量 num  
//初始隊列
int Initteam(team &L){
	L=(cteam *)malloc(sizeof(cteam));
	if(L==NULL){
		printf("申請空間失敗！");
		return false;
	}
	L->front=L->rear=-1;
	return true;
}
//入隊
int pushteam(team &L,int x){
	if(num==max){
		printf("隊滿");
		return false;
	}else{
		L->rear=(L->rear+1)%max;  //rear始終在0-10中循環
		L->data[L->rear]=x; 
		num++;
		return true;
	}
} 
//出隊
int popteam(team &L,int &x){
	if(num==0){
		printf("隊空！");
		return false;
	}else{
		L->front=(L->front+1)%max;  //front始終在0-10中循環
		x=L->data[L->front];
		num--;
		printf("\n%d出隊\n",x);
		return x;
	} 
}
//遍歷隊
void printteam(team L){
	int p;
	p=L->front+1;
	if(L->front<L->rear){
		while(p<=L->rear){
		printf("%d ",L->data[p]);
		p++;}
	}else{
		while((p-1)!=L->rear){
			printf("%d ",L->data[p]);
			p=(p+1)%max;
		}
	}
  }
//求隊長 
 int teamlength(team L){
 	int p;
 	if(L->front<L->rear){
 		p=(L->rear)-(L->front);      //當隊列正常時 
	 }else{
	 	p=L->rear+(max-(L->front));  //當隊列開始循環時 
	 }
	printf("\n隊長為：%d",p);
 }
 //取隊頭元素
  int gettop(team L){
  	if(L->front==L->rear){
  		printf("隊空！");
  		return false;
	  }else{
	  	int t=L->data[L->front+1];
	  	return t;
	  }
  } 
  
  
  /*     
  		pushteam:入隊函數	popteam:出隊函數 
  		printteam:遍歷函數	gettop:取隊頭函數 
  		Initteam:初始化函數	teamlength:求隊長函數 
  */
  
  
int main(){
	team s;
	int w;
	Initteam(s);
	//1-3進隊列 
	pushteam(s,1);      
	pushteam(s,2);
	pushteam(s,3);
	printf("------1-3進隊列后----------\n");
	printf("此時隊列為：");
	printteam(s);
   	popteam(s,w);
	popteam(s,w);
	printf("此時隊列為：");
	printteam(s);
	printf("\n------4-6進隊列后----------\n");
	pushteam(s,4);
	pushteam(s,5);
	pushteam(s,6);
	printf("此時隊列為：");
	printteam(s);
	teamlength(s);
	int T=gettop(s);
	printf("\n隊頭元素為：%d",T);
}