C++循环队列

#include <iostream>
using namespace std;


class Queue
{
int front;
int rear;
int maxsize;
int *data;
public:
Queue(int n){ data = new int[n]; maxsize = n; front = rear = 0; }
void enQueue(int);
void deQueue(int &);
int getLength();
void print();
};
void Queue::print()
{
for (int i = 0; i < getLength(); i++)
cout << data[i] << endl;
}
int Queue::getLength()
{
return (rear - front + maxsize) % maxsize;
}
void Queue::enQueue(int a)
{
if ((rear + 1) % maxsize == front)
cout << "队列满" << endl;
else
{
data[rear] = a;
rear = (rear + 1) % maxsize;
}
}
void Queue::deQueue(int &a)
{
if (rear == front)
cout << "队列空" << endl;
else
{
a = data[front];
front = (front + 1) % maxsize;
}
}
int main()
{
int t,n;
cin >> t;

int data;

       //t个例子 

while (t-- > 0)

{

        //n个数字

cin >> n;
Queue k(n+1);
for (int i = 0; i < n; i++)
{
cin >> data;
k.enQueue(data);
}
cout << k.getLength() << endl;
k.print();
}
system("pause");
}