Java用循环数组实现队列

public interface My_queue<T> {
void add(T t);
T remove();
int size();
boolean isEmpty();
T front();
}

public class My_arrayQueue<T> implements My_queue<T>{

private T[] data;
private int size;
private int front;
private int rear;
public My_arrayQueue() {
data = (T[])new Object[3];
size = 0;
front = 0;
rear = 0;
}

@Override
public void add(T t) {
if(isFull()){
resize();
front = 0;
}
rear = (front+size)%data.length;
data[rear] = t;
size++;
}

@Override
public T remove() {
if(isEmpty()){
throw new RuntimeException("queue is empty!");
}
T tempData = data[front];
data[front] = null;
front = (front+1)%data.length;
size--;
return tempData;
}

@Override
public int size() {
return size;
}

@Override
public boolean isEmpty() {
return size == 0;
}

@Override
public T front() {
if(isEmpty()){
throw new RuntimeException("queue is empty!");
}
return data[front];
}

public boolean isFull(){
return size == data.length;
}

public void resize(){
T[] tmp = (T[])new Object[data.length*2];
System.arraycopy(data, 0, tmp, 0, data.length);
data = tmp;
tmp = null;
}

}

public class arrayTest {
public static void main(String[] args){
My_arrayQueue<Integer> arr = new My_arrayQueue<>();
arr.add(1);
arr.add(2);
arr.add(3);
arr.add(4);
arr.add(5);
arr.add(6);
System.out.println(arr.size()+" "+arr.isEmpty());
while(!arr.isEmpty()){
Integer temp = arr.remove();
System.out.println(temp);
}
}
}