shuzu.h

本程序中分别用数组和链表实现了环形队列

#include<iostream.h>
//int size= 10;
//template<class T,int size=10>
class List{
	public:
		int Array[10];
		int last,length;
		List(int p=-1,int q=0){ last=p;length=q; }
		bool isFull();
		bool isEmpty();
		int deleteHead();
		void addtoTail(int);
		void print();
		void enter();
};

bool List::isFull()
{
	return length==0;
}
bool List::isEmpty()
{
	return length==10;
}

void List::addtoTail(int el)
{
	if (!isFull() )
	{
		last= (++last)% 10;
		length++;
		Array[last]=el;
	}
	else
		cout<<"Full queue!"<<endl;
}
int List::deleteHead()
{
	if(!isEmpty())
	{
		length--;
		return Array[last-length+1];
	}
	else{
		cout<<"Empty queue!"<<endl;
		return Array[0];
	}
}

void List::print(){
	int first=last-length+1;
	for(int i=0; i<length;i++)
	{
		cout<<"Queue is:\n"<<Array[first+i]<<"  ";
	}
	cout<<endl;
}

void List::enter()
{
	cout<<"请依次输入队列的元素: \n";
	int temp;
	while(cin>>temp ){
		addtoTail(temp);
	}
	cin.clear();
}