class SeqQueue
{
private:
	DataType data[MaxQueueSize];		//順序隊(duì)列數(shù)組
	int front;							//隊(duì)頭指示器
	int rear;							//隊(duì)尾指示器
	int count;							//元素個(gè)數(shù)計(jì)數(shù)器
public:
	SeqQueue(void)				  		//構(gòu)造函數(shù)
		{front = rear = 0; count = 0;}; 
	~SeqQueue(void){};  				//析構(gòu)函數(shù)

	void Append(const DataType& item);	//入隊(duì)列
	DataType Delete(void);       		//出隊(duì)列
	DataType GetFront(void)const; 		//取隊(duì)頭數(shù)據(jù)元素
	int NotEmpty(void)const  			//非空否
		{return count != 0;};
};

void SeqQueue::Append(const DataType& item)	//入隊(duì)列
//把數(shù)據(jù)元素item插入隊(duì)列作為當(dāng)前的新隊(duì)尾
{
   if(count > 0 && front == rear)
   {
      cout << "隊(duì)列已滿!" << endl;
	  exit(0);
   }

   data[rear] = item;						//把元素item加在隊(duì)尾
   rear = (rear + 1) % MaxQueueSize;		///隊(duì)尾指示器加1
   count++;									//計(jì)數(shù)器加1
}

DataType SeqQueue::Delete(void)					//出隊(duì)列
//把隊(duì)頭元素出隊(duì)列，出隊(duì)列元素由函數(shù)返回
{
   if(count == 0)
   {
      cout << "隊(duì)列已空!" << endl;
	  exit(0);
   }

   DataType temp = data[front];				//保存原隊(duì)頭元素
   front = (front + 1) % MaxQueueSize;		//隊(duì)頭指示器加1
   count--;									//計(jì)數(shù)器減1
   return temp;								//返回原隊(duì)頭元素
}

DataType SeqQueue::GetFront(void)const		//取隊(duì)頭數(shù)據(jù)元素
//取隊(duì)頭元素并由函數(shù)返回
{  
   if(count == 0)
   {
      cout << "隊(duì)列空!" << endl;
	  exit(0);
   }
   return data[front];						//返回隊(duì)頭元素
}