实现循环队列

可以用一个数组来实现一个队列，那如果将数组的尾巴和头连接起来，是不是构成一个循环队列了呢
从顺序队列到循环队列
设计的思想：

1. rear表示当前可以存放的数据元素的下标
2. front == rear 队列是空的
3. 浪费一个空间，如果rear的下一个是front 就认为是满的
4. 出队列就是front后移

实现中比较难的地方在于怎么让rear + 1就到数组的front 或者 出队的时候怎么让front到front
我们可以这样：rear = (rear + 1) % length或者front = (front + 1) % length这样就完美解决问题

下面是实现代码：

class MyCircularQueue {
    public int[] elem;
    public int front;
    public int rear;

    /** Initialize your data structure here. Set the size of the queue to be k. */
    public MyCircularQueue(int k) {
        this.elem = new int[k + 1];
        this.front = 0;
        this.rear = 0;

    }

    /** Insert an element into the circular queue. Return true if the operation is successful. */
    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }
        this.elem[rear] = value;
        this.rear = (this.rear + 1) % this.elem.length;
        return true;
    }

    /** Delete an element from the circular queue. Return true if the operation is successful. */
    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        this.front = (this.front + 1) % this.elem.length;
        return true;
    }

    /** Get the front item from the queue. */
    public int Front() {
        if (isEmpty()) {
            return -1;
        }
        return this.elem[front];
    }

    /** Get the last item from the queue. */
    public int Rear() {
        if (isEmpty()) {
            return -1;
        }
        int rear = this.rear == 0 ? this.elem.length - 1 : this.rear - 1;
        return this.elem[rear];
    }

    /** Checks whether the circular queue is empty or not. */
    public boolean isEmpty() {
        if (this.front == this.rear) {
            return true;
        }
        return false;
    }

    /** Checks whether the circular queue is full or not. */
    public boolean isFull() {
        if ((this.rear + 1) % this.elem.length == this.front) {
            return true;
        }
        return false;
    }
}