#include"3。4。1.h"
#include"iostream.h"
template<class T>
Queue<T>::Queue(int s)
{
	//構(gòu)造函數(shù)。創(chuàng)建隊(duì)列空間，生成一個(gè)空隊(duì)列
	MaxSize=s;
	elements=new T [MaxSize];                               //創(chuàng)建隊(duì)列空間
	front=rear=0;                                           //生成一個(gè)空隊(duì)列
}
template<class T>
int Queue<T>::EnQueue(const T&item)
{
	//入隊(duì)。若隊(duì)列不滿(mǎn)，則item插入隊(duì)尾，返回0；否則返回-1
	if(!IsFull())
	{
		elements[rear]=item;                                //入隊(duì)
		rear=(rear+1)%MaxSize;                              //隊(duì)尾指針增1
		return 0;                                           //返回0
	}
	else return -1;
}
template<class T>
T Queue<T>::DeQueue(void)
{
	//出隊(duì)。若隊(duì)列不空，則刪除隊(duì)頭元素，返回該元素的值。否則返回NULL
	if(!IsEmpty())
	{
		T item=elements[front]; 
		front=(front+1)%MaxSize;                           //隊(duì)頭指針增1
		return item;                                       //隊(duì)列非空，返回隊(duì)頭元素的值
	}
	else return NULL;                                      //空隊(duì)，返回NULL
}
template<class T>
T Queue<T>::GetFront(void)
{
	//隊(duì)列非空，返回隊(duì)頭元素的值
	if(!IsEmpty())
	{
		//隊(duì)列非空，返回隊(duì)頭元素的值
		return elements[front];
	}
	//空隊(duì)，返回NULL
	else 
		return NULL;
}
template<class T>
void Queue<T>::Issymmetric(char Q[100],int len)
{
    int flag=1;
	const int size=100;
    int Z[size]; 
    for(int i=0;i<len;i++)
	{
	EnQueue(Q[i]);
	}
	for(i=0;i<len;i++)
	{
	Z[i]=DeQueue();
	}
	for(i=0;i<len/2;i++)
	{
     if(Z[i]==Z[len-i-1])
	 {flag=1;break;}
     else 
	 {flag=0;break;}
	}
	if(flag==1)
	   cout<<"This character is symmetric!"<<endl;
    else
	    cout<<"This character isn't symmetric!"<<endl;
}