C++实现循环队列和链式队列的示例

 template class SeqQueue{ protected: T *element; int front,rear; int maxSize; public: SeqQueue(int sz=10){ front=rear=0; maxSize=sz; element=new T[maxSize]; } ~SeqQueue(){ delete[] element; } bool EnQueue(const T& x){//入队 if(isFull()) return false; element[rear]=x; rear=(rear+1)%maxSize; return true; } bool DeQueue(T& x){//出队 if(isEmpty()) return false; x=element[front]; front=(front+1)%maxSize; return true; } bool getFront(T& x){//获取队首元素 if(isEmpty()) return false; x=element[front]; return true; } void makeEmpty(){//队列置空 front=rear=0; } bool isEmpty()const{//判断队列是否为空 return (rear==front)?true:false; } bool isFull()const{//队列是否为满 return ((rear+1)%maxSize==front)?true:false; } int getSize()const{ return (rear-front+maxSize)%maxSize; } };

 void menu(){ cout<<"1.入队"< *sq){ switch(num){ int x; case 1: cin>>x; sq->EnQueue(x); break; case 2: sq->getFront(x); cout<DeQueue(x); break; case 4: sq->makeEmpty(); break; case 5: x=sq->getSize(); cout< *sq=new SeqQueue; int num; while(true){ menu(); cin>>num; function(num,sq); } delete sq; return 0; }

 #include  using namespace std; template struct LinkNode{ T data; LinkNode *link; LinkNode(T& x,LinkNode *l=NULL){ data=x; link=l; } }; template class LinkedQueue{ protected: LinkNode *front,*rear; public: LinkedQueue(){ front=rear=NULL; } ~LinkedQueue(){ makeEmpty(); } bool enQueue(T& x){ if(front==NULL) front=rear=new LinkNode(x); else{ rear=rear->link=new LinkNode(x); } return true; } bool deQueue(T& x){ if(isEmpty()) return false; LinkNode *p=front; x=front->data; front=front->link; delete p; return true; } bool getFront(T& x)const{ if(isEmpty()) return false; x=front->data; return true; } void makeEmpty(){ LinkNode *p; while(front!=NULL){ p=front; front=front->link; delete p; } } bool isEmpty()const{ return (front==NULL)?true:false; } int getSize()const{ LinkNode *p; int count=0; p=front; while(p!=NULL){ count++; p=p->link; } return count; } }; void menu(){ cout<<"1.入队"< *lq){ switch(num){ int x; case 1: cin>>x; lq->enQueue(x); break; case 2: lq->getFront(x); cout<deQueue(x); break; case 4: lq->makeEmpty(); break; case 5: x=lq->getSize(); cout< *lq=new LinkedQueue; int num; while(true){ menu(); cin>>num; function(num,lq); } delete lq; return 0; }