Class MyCircularDeque

DesignCircularDeque.java:1–74

class MyCircularDeque {
    int front;
    int rear;
    int size;
    int capacity;
    int deque[];
    public MyCircularDeque(int k) {
        deque = new int[k];
        front = 0;
        rear = k-1;
        size=0;
        capacity = k;
    }
    
    public boolean insertFront(int value) {
        if(isFull()){
            return false;
        }
        front = (front - 1 + capacity) % capacity;
        deque[front] = value;
        size++;
        return true;
    }
    
    public boolean insertLast(int value) {
        if(isFull()){
            return false;
        }
        rear = (rear + 1) % capacity;
        deque[rear] = value;
        size++;
        return true;
    }
    
    public boolean deleteFront() {
         if(isEmpty()){
            return false;
        }
        front = (front + 1 ) % capacity;
        size--;
        return true;
    }
    
    public boolean deleteLast() {
         if(isEmpty()){
            return false;
        }
        rear = (rear - 1 + capacity) % capacity;
        size--;
        return true;
    }
    
    public int getFront() {
        if(isEmpty()){
            return -1;
        }
        return deque[front];
    }
    
    public int getRear() {