数据结构之自定义循环队列

package Queue;

public interface Queue<E> {
    int getSize();
    boolean isEmpty();
    void enqueue(E e);
    E dequeue();
    E getFront();
}

package Queue;

public class MyLoopQueue<E> implements Queue<E> {
    private E[] data;
    private int front,tail;
    private int size;

    public MyLoopQueue(int capacity){
        data = (E[]) new Object[capacity+1];
        front = 0 ;
        tail = 0 ;
        size = 0;
    }

    public MyLoopQueue(){
        this(10);
    }

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

    public int getCapacity(){
        return data.length-1;
    }
    @Override
    public boolean isEmpty() {
        return front == tail;
    }

    @Override
    public void enqueue(E e) {
        if (front == (tail + 1)%data.length) {
            resize(getCapacity()*2);
        }
        data[tail] = e;
        tail=(tail+1)%data.length;
        size ++;
    }

    private void resize(int c) {
        E[] newData = (E[]) new Object[c];
        for (int i = 0; i<size;i++){
            newData[i] = data[(i+front)%data.length];
        }
        data = newData;
        front = 0 ;
        tail = size;
    }

    @Override
    public E dequeue() {
        if (isEmpty()){
            throw new IllegalArgumentException("Queue cannot dequeue from an empty queue");
        }
        E e = data[front];
        data[front] = null;
        front = (front + 1)%data.length;
        size--;
        if (size==getCapacity()/4 && getCapacity()/2!=0)
            resize(getCapacity()/2);
        return e;
    }

    @Override
    public E getFront() {
        if (isEmpty()){
            throw new IllegalArgumentException("Queue cannot getFront  from an empty queue");
        }
        return data[front];
    }
    @Override
    public String toString() {
        StringBuilder res = new StringBuilder();
        res.append(String.format("Queue : size = %d,capacity = %d\n", size, getCapacity()));
        res.append("front [ ");
        for (int i = front; i != tail; i = (i + 1) % data.length) {
            res.append(data[i]);
            if ((i + 1) % data.length != tail)
                res.append(" , ");
        }
        res.append(" ] tail");
        return res.toString();
}
}