LeetCode 641.设计循环双端队列

题目描述

设计实现双端队列。
你的实现需要支持以下操作：
MyCircularDeque(k)：构造函数,双端队列的大小为k。
insertFront()：将一个元素添加到双端队列头部。 如果操作成功返回 true。
insertLast()：将一个元素添加到双端队列尾部。如果操作成功返回 true。
deleteFront()：从双端队列头部删除一个元素。 如果操作成功返回 true。
deleteLast()：从双端队列尾部删除一个元素。如果操作成功返回 true。
getFront()：从双端队列头部获得一个元素。如果双端队列为空，返回 -1。
getRear()：获得双端队列的最后一个元素。 如果双端队列为空，返回 -1。
isEmpty()：检查双端队列是否为空。
isFull()：检查双端队列是否满了。

示例： MyCircularDeque circularDeque = new MycircularDeque(3); //
设置容量大小为3 circularDeque.insertLast(1); // 返回 true
circularDeque.insertLast(2); // 返回 true
circularDeque.insertFront(3); // 返回 true
circularDeque.insertFront(4); // 已经满了，返回 false
circularDeque.getRear(); // 返回 2 circularDeque.isFull();
// 返回 true circularDeque.deleteLast(); // 返回 true
circularDeque.insertFront(4); // 返回 true
circularDeque.getFront(); // 返回 4

解题思路

C++双端队列容器的使用

Cpp实现

class MyCircularDeque {
    vector<int> deque;
    int max_size;
public:
    /** Initialize your data structure here. Set the size of the deque to be k. */
    MyCircularDeque(int k) {
        max_size = k;
    }
    
    /** Adds an item at the front of Deque. Return true if the operation is successful. */
    bool insertFront(int value) {
        if(deque.size() == max_size)
        return false;
        deque.insert(deque.begin(),value);
        return true;
    }
    
    /** Adds an item at the rear of Deque. Return true if the operation is successful. */
    bool insertLast(int value) {
        if(deque.size() == max_size)
        return false;
        deque.push_back(value);
        return true;
    }
    
    /** Deletes an item from the front of Deque. Return true if the operation is successful. */
    bool deleteFront() {
        if(deque.size() == 0)
        return false;
        deque.erase(deque.begin());
        return true;
    }
    
    /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
    bool deleteLast() {
        if(deque.size() == 0)
        return false;
        deque.pop_back();
        return true;
    }
    
    /** Get the front item from the deque. */
    int getFront() {
        if(deque.size() == 0)
        return -1;
        return deque[0];
    }
    
    /** Get the last item from the deque. */
    int getRear() {
        if(deque.size() == 0)
        return -1;
        int s = deque.size();
        return deque[s - 1];
    }
    
    /** Checks whether the circular deque is empty or not. */
    bool isEmpty() {
        return deque.size() == 0 ? true : false;
    }
    
    /** Checks whether the circular deque is full or not. */
    bool isFull() {
        return deque.size() == max_size ? true : false;
    }
};

/**
 * 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();
 */

Python实现

• 用列表实现循环双端队列(即在队首队尾进行操作)

class MyCircularDeque:

    def __init__(self, k: int):
        """
        Initialize your data structure here. Set the size of the deque to be k.
        """
        self.k = k
        self.l = []
        

    def insertFront(self, value: int) -> bool:
        """
        Adds an item at the front of Deque. Return true if the operation is successful.
        """
        if len(self.l) == self.k:
            return False
        self.l.insert(0,value)
        return True

    def insertLast(self, value: int) -> bool:
        """
        Adds an item at the rear of Deque. Return true if the operation is successful.
        """
        if len(self.l) == self.k:
            return False
        self.l.append(value)
        return True
        

    def deleteFront(self) -> bool:
        """
        Deletes an item from the front of Deque. Return true if the operation is successful.
        """
        if len(self.l) == 0:
            return False
        self.l.pop(0)
        return True
        

    def deleteLast(self) -> bool:
        """
        Deletes an item from the rear of Deque. Return true if the operation is successful.
        """
        if len(self.l) == 0:
            return False
        self.l.pop(-1)
        return True
        

    def getFront(self) -> int:
        """
        Get the front item from the deque.
        """
        if len(self.l) == 0:
            return -1
        return self.l[0]

    def getRear(self) -> int:
        """
        Get the last item from the deque.
        """
        if len(self.l) == 0:
            return -1
        return self.l[-1]

        

    def isEmpty(self) -> bool:
        """
        Checks whether the circular deque is empty or not.
        """
        return len(self.l) == 0 
        

    def isFull(self) -> bool:
        """
        Checks whether the circular deque is full or not.
        """
        return len(self.l) == self.k         


# Your MyCircularDeque object will be instantiated and called as such:
# obj = MyCircularDeque(k)
# param_1 = obj.insertFront(value)
# param_2 = obj.insertLast(value)
# param_3 = obj.deleteFront()
# param_4 = obj.deleteLast()
# param_5 = obj.getFront()
# param_6 = obj.getRear()
# param_7 = obj.isEmpty()
# param_8 = obj.isFull()

• 对于列表的使用