LeetCode 641 设计循环双端队列

使用循环链表实现

class MyCircularDeque {
private:
    list<int> l;
    int k;
public:
    MyCircularDeque(int m) :k(m) {

    }
    
    bool insertFront(int value) {
        if(l.size() == k) return false;
        l.push_front(value);
        return true;
    }
    
    bool insertLast(int value) {
        if(l.size() == k) return false;
        l.push_back(value);
        return true;
    }
    
    bool deleteFront() {
        if(!isEmpty()){
            l.pop_front();
            return true;
        } 
        return false;
    }
    
    bool deleteLast() {
        if(!isEmpty()){
            l.pop_back();
            return true;
        } 
        return false;
    }
    
    int getFront() {
        if(!isEmpty()){
            return l.front();
        } 
        return -1;
    }
    
    int getRear() {
        if(!isEmpty()){
            return l.back();
        } 
        return -1;
    }
    
    bool isEmpty() {
        return l.empty();
    }
    
    bool isFull() {
        return l.size() == k;
    }
};

/**
 * Your MyCircularDeque object will be instantiated and called as such:
 * MyCircularDeque* obj = new MyCircularDeque(k);
 * bool param_1 = obj->insertFront(value);
 * bool param_2 = obj->insertLast(value);
 * bool param_3 = obj->deleteFront();
 * bool param_4 = obj->deleteLast();
 * int param_5 = obj->getFront();
 * int param_6 = obj->getRear();
 * bool param_7 = obj->isEmpty();
 * bool param_8 = obj->isFull();
 */