【数据结构】队列的简单实现

/**
 * @date 2018/10/26
 * 队列
 */
public class MyCycleQueue {
    //底层使用数组
    private long[] arr;
    //有效数据的大小
    private int elements;
    //队头
    private int front;
    //队尾
    private int end;

    /**
     * 默认构造方法
     */
    public MyCycleQueue(){
        arr = new long[10];
        elements = 0;
        front = 0;
        end = -1;
    }

    /**
     * 有参构造
     * @param maxSize
     */
    public MyCycleQueue(int maxSize){
        arr = new long[maxSize];
        elements = 0;
        front = 0;
        end = -1;
    }

    /**
     * 从队尾插入
     */
    public void insert(long value){
        if (end == arr.length - 1) end = -1;
        arr[++end] = value;
        elements++;
    }

    /**
     * 删除数据,从队头删除
     */
    public long remove(){
        long value =  arr[front++];
        if (front == arr.length) front = 0;
        elements--;
        return value;
    }

    /**
     * 查看数据
     * @return
     */
    public long peek(){
        return arr[front];
    }

    /**
     * 判断是否为空
     * @return
     */
    public boolean isEmpty(){
        return elements == 0;
    }

    /**
     * 判断是否已经满了
     * @return
     */
    public boolean isFull(){
        return elements == arr.length;
    }


}