循环队列  1 #include
     
       2 using namespace std; 3 //#define maxSize 20 4 template 
      
        5 class Queue 6 { 7 private : 8 //    T data[maxSize]; 9     int maxSize;10     T *data;11     T Front;12     T rear;13     int Count;14 public:15     Queue()16     {17         Front = 0;18         rear = 0;19         Count = 0;20         cout<<"input the queue maxsize"<
       
        >maxSize;22         data = new T[maxSize];23     }24     void enQueue( T & x)25     {26         if(Count > 0 && Front == rear)27         {28             cout<<"Queue is full"<
        

dusk;76 int j;77 cin>>j;78 for(int i = 0 ; i < j ; i++ )79 {80 dusk.enQueue(i);81 }82 dusk.printQueue();83 84 }