CirQueueX循环队列的实现

寒泉opens

于 2014-10-26 19:24:22 发布

阅读量268

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/u013725851/article/details/40479191

本文介绍如何使用C++模板类实现循环队列，包括队列的创建、入队、出队、获取队头元素、获取队尾元素、判断是否为空、判断是否满、清空队列和遍历队列等操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream.h>
#include <stdlib.h>
#include<stdexcept>
using namespace std;
template<class T>
struct Node{
   T data;
   Node<T> *next;

};
template<class T>
class CirQueue
{
   private:
       //T *base;
       Node<T>* front;
       Node<T> * real;
       //int queuesize;
   public:
       CirQueue( );
       ~CirQueue();
       void EnQueue(T x);
       T DeQueue();
       T GetHead();
       T GetLast();
       int QueueEmpty();
       int QueueFull();
       void ClearQueue();
       void QueueTranverse();



};
template<class T>
CirQueue<T>::CirQueue()
{
   //base=new T[m];
   /*if(base==NULL)
   {
       cout<<"队列建立失败"<<endl;
       exit(1);
   }*/

   //queuesize=m;
   front=new Node<T>;
   front->next=NULL;
   real=front;

}

template<class T>
CirQueue<T>::~CirQueue()
{
   /*delete [] base;
   front=real=0;
   queuesize=0;*/
   Node<T> *p;
   while (front)
   { p=front;
   front=front->next;
       delete p;
   }
}
template<class T>
void CirQueue<T>::EnQueue(T x)
{
   /*if((real+1)%queuesize==front) throw " over error";
   base[real]=x;
   real=(real+1)%queuesize;*/
   Node<T> *s;
   s=new Node<T>;
   s->data=x;

       s->next=real->next;
   real->next=s;
   real=s;
   if(front->next==NULL)
       front->next=s;
}
template<class T>
T CirQueue<T>::DeQueue()
{
   if(front==real) throw " error null";
   T x;
   //x=base[front];
   //front=(front+1)%queuesize;
   //return x;
   Node<T> *p;
   p=front->next;
x=p->data;
front->next=p->next;
   if(real->next==NULL)
       real=front;
delete p;
return x;



}
template<class T>
void CirQueue<T>::QueueTranverse()
{
   /*for(int i=front;i<queuesize;i++)
       cout<<base[i]<<endl;*/
   //Node<>
   while (front->next)
   {
       cout<<front->next->data<<endl;
       front=front->next;
   }

}

int main(int argc, char* argv[])
{
   CirQueue<int> queue;
   queue.EnQueue(1);
   queue.EnQueue(2);
   //queue.DeQueue();
   //cout<<queue.DeQueue()<<endl;
   queue.QueueTranverse();

   return 0;
}