Java数据结构——队列

public class MyQueue<T> {
    //队列顺序存储
    private T[] arrays;
    //队首位置
    private int head;
    //队尾位置
    private int tail;
    //队内有效个数
    private int size;
    //常量
    private static final int CAPACITY = 10;
    
    //初始化
    public MyQueue(){
        arrays = (T[])new Object[CAPACITY];
    }

    //判满
    private boolean isFull(){
        return size == arrays.length;
    }

    //入队
    public void enQueue(T value){
        if(isFull()){
            arrays =  Arrays.copyOf(arrays,arrays.length*2);
        }
        arrays[tail++] = value;
        size++;
    }

    //判空
    public boolean isEmpty(){
        return size == 0;
    }

    //出队
    public void deQueue(){
        if (isEmpty()){
            return;
        }
        arrays[head++] = null;
        size--;
    }

    //打印
    @Override
    public String toString() {
        return "MyQueue{" + Arrays.toString(arrays) +
                '}';
    }
    
}