641. Design Circular Deque

Design your implementation of the circular double-ended queue (deque).

Your implementation should support following operations:

MyCircularDeque(k): Constructor, set the size of the deque to be k.
insertFront(): Adds an item at the front of Deque. Return true if the operation is successful.
insertLast(): Adds an item at the rear of Deque. Return true if the operation is successful.
deleteFront(): Deletes an item from the front of Deque. Return true if the operation is successful.
deleteLast(): Deletes an item from the rear of Deque. Return true if the operation is successful.
getFront(): Gets the front item from the Deque. If the deque is empty, return -1.
getRear(): Gets the last item from Deque. If the deque is empty, return -1.
isEmpty(): Checks whether Deque is empty or not.
isFull(): Checks whether Deque is full or not.

Example

Design your implementation of the circular double-ended queue (deque).

Your implementation should support following operations:

MyCircularDeque(k): Constructor, set the size of the deque to be k.
insertFront(): Adds an item at the front of Deque. Return true if the operation is successful.
insertLast(): Adds an item at the rear of Deque. Return true if the operation is successful.
deleteFront(): Deletes an item from the front of Deque. Return true if the operation is successful.
deleteLast(): Deletes an item from the rear of Deque. Return true if the operation is successful.
getFront(): Gets the front item from the Deque. If the deque is empty, return -1.
getRear(): Gets the last item from Deque. If the deque is empty, return -1.
isEmpty(): Checks whether Deque is empty or not. 
isFull(): Checks whether Deque is full or not.

题目分析：设计一个双向队列。 这里存储容器可以用数组，另外需要头指针和尾指针以及数组的初始化长度。

class MyCircularDeque {
    
    int[] deque;
    int front;
    int tail;
    int len;

    /** Initialize your data structure here. Set the size of the deque to be k. */
    public MyCircularDeque(int k) {
        this.len = k + 1;
        deque = new int[len];
        front = 0;
        tail = 1;
    }


    /** Adds an item at the front of Deque. Return true if the operation is successful. */
    public boolean insertFront(int value) {
        if( !isFull() ){
            deque[front] = value;
            front = (front-1+len)%len;
            
            return true;
        }
        
        return false;
    }
    
    /** Adds an item at the rear of Deque. Return true if the operation is successful. */
    public boolean insertLast(int value) {
        if( !isFull() ){
            deque[tail] = value;
            tail = (tail + len+1)%len;
            
            return true;
        }
        return false;
    }
    
    /** Deletes an item from the front of Deque. Return true if the operation is successful. */
    public boolean deleteFront() {
        if( !isEmpty() ){
            front = (front + len + 1)%len;
            deque[front] = 0;
            return true;
        }
        return false;
    }
    
    /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
    public boolean deleteLast() {
        if( !isEmpty() ){
            tail = (tail - 1 + len) % len;
            deque[tail] = 0;
            return true;
        }        
        return false;
    }
    
    /** Get the front item from the deque. */
    public int getFront() {
        
        if( isEmpty() ){
            return -1;
        }
        
        return deque[(front + 1)%len];
    }
    
    /** Get the last item from the deque. */
    public int getRear() {
        
        if(isEmpty()){
            return -1;
        }
        
        return deque[( tail - 1 + len)% len];
    }
    
    /** Checks whether the circular deque is empty or not. */
    public boolean isEmpty() {
        if( (front + 1) % len == tail ){
            return true;
        }else{
            return false;
        }
    }
    
    /** Checks whether the circular deque is full or not. */
    public boolean isFull() {
        if( front == tail ){
            return true;
        }else{
            return false;
        }
    }
}