Queue1循环队列

循环队列

 1 #include<iostream>
 using namespace std;
 //#define maxSize 20
 template <class T>
 class Queue
 {
 private :
 //    T data[maxSize];
     int maxSize;
     T *data;
     T Front;
     T rear;
     int Count;
 public:
     Queue()
     {
         Front = ;
         rear = ;
         Count = ;
         cout<<"input the queue maxsize"<<endl;
         cin>>maxSize;
         data = new T[maxSize];
     }
     void enQueue( T & x)
     {
         if(Count >  && Front == rear)
         {
             cout<<"Queue is full"<<endl;
         }
         data[rear] = x;
         rear = (rear + ) % maxSize;
         Count++;
     }
     void outQueue()
     {
         if(Count == )
         {
             cout <<"Queue is empty"<<endl;
         }
         T tem = data[Front];
         Front = (Front +  )% maxSize;
         cout<<"out elem:"<<tem<<endl;
     }
     int isEmpty()
     {
         return Count == ;
     }
     void makeEmpty()
     {
         Front = ;
         rear = ;
         Count = ;
     }
     T readhead()
     {
         T tem = data[Front];
         return tem;
     }
     void printQueue()
     {
         int j = Front;
         for(int i =  ; i < Count ; i++ )
         {
             cout<<data[j]<<" ";
             j = ( j +  )%maxSize;
         }
     }
     int getlength()
     {
         return Count;
     }
 };
 int main()
 {
     Queue <int> dusk;
     int j;
     cin>>j;
     for(int i =  ; i < j ; i++ )
     {
         dusk.enQueue(i);
     }
     dusk.printQueue();

 }