641. 设计循环双端队列

题目：

https://leetcode-cn.com/problems/design-circular-deque/

import java.util.ArrayDeque;
import java.util.Deque;

class _641_MyCircularDeque {
    private Deque<Integer> deque;
    private int scale;

    public _641_MyCircularDeque(int k) {
        deque = new ArrayDeque<>(k);
        scale = k;
    }

    public boolean insertFront(int value) {
        if(isFull()) {
            return false;
        }
        else {
            deque.addLast(value);
            return true;
        }
    }

    public boolean insertLast(int value) {
        if(isFull()) {
            return false;
        }
        else {
            deque.push(value);
            return true;
        }
    }

    public boolean deleteFront() {
        if(isEmpty()) {
            return false;
        }
        else {
            deque.pollLast();
            return true;
        }
    }

    public boolean deleteLast() {
        if(isEmpty()) {
            return false;
        }
        else {
            deque.pollFirst();
            return true;
        }
    }

    public int getFront() {
        if (isEmpty()) {
            return -1;
        }
        else {
            return deque.peekLast();
        }
    }

    public int getRear() {
        if(isEmpty()) {
            return -1;
        }
        else {
            return deque.peekFirst();
        }
    }

    public boolean isEmpty() {
        return deque.isEmpty();
    }

    public boolean isFull() {
        return deque.size() == scale;
    }
}