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 = 0;
        rear = 0;
        Count = 0;
        cout<<"input the queue maxsize"<<endl;
        cin>>maxSize;
        data = new T[maxSize];
    }
    void enQueue( T & x)
    {
        if(Count > 0 && Front == rear)
        {
            cout<<"Queue is full"<<endl;
        }
        data[rear] = x;
        rear = (rear + 1) % maxSize;
        Count++;
    }
    void outQueue()
    {
        if(Count == 0)
        {
            cout <<"Queue is empty"<<endl;
        }
        T tem = data[Front];
        Front = (Front + 1 )% maxSize;
        cout<<"out elem:"<<tem<<endl;
    }
    int isEmpty()
    {
        return Count == 0;
    }
    void makeEmpty()
    {
        Front = 0;
        rear = 0;
        Count = 0;
    }
    T readhead()
    {
        T tem = data[Front];
        return tem;
    }
    void printQueue()
    {
        int j = Front;
        for(int i = 0 ; i < Count ; i++ )
        {
            cout<<data[j]<<" ";
            j = ( j + 1 )%maxSize;
        }
    }
    int getlength()
    {
        return Count;
    }
};
int main()
{
    Queue <int> dusk;
    int j;
    cin>>j;
    for(int i = 0 ; i < j ; i++ )
    {
        dusk.enQueue(i);
    }
    dusk.printQueue();

}