Leetcode 641. Design Circular Deque [Python]

基本思想和LRU用的DS一样，都是双向节点。

class double_Node:
    def __init__(self, value):
        self.val = value
        self.next = self
        self.prev = self
        
class MyCircularDeque:

    def __init__(self, k: int):
        """
        Initialize your data structure here. Set the size of the deque to be k.
        """
        self.cap = k
        self.root = double_Node(-1)
        self.count = 0
        

    def insertFront(self, value: int) -> bool:
        """
        Adds an item at the front of Deque. Return true if the operation is successful.
        """
        if self.count == self.cap:return False
        root = self.root
        new_node = double_Node(value)
        new_node.next = root.next
        new_node.prev = root
        root.next.prev = new_node
        root.next = new_node
        self.count += 1
        #print(self.count)
        return True

    def insertLast(self, value: int) -> bool:
        """
        Adds an item at the rear of Deque. Return true if the operation is successful.
        """
        if self.count == self.cap:return False
        root = self.root
        new_node = double_Node(value)
        curtail = root.prev
        new_node.prev = curtail
        new_node.next = curtail.next
        curtail.next = new_node
        root.prev = new_node
        self.count += 1
        #print(self.count)
        return True
        

    def deleteFront(self) -> bool:
        """
        Deletes an item from the front of Deque. Return true if the operation is successful.
        """
        if self.count == 0:return False
        root = self.root
        node = root.next
        root.next = node.next
        node.next.prev = node.prev
        self.count -= 1
        return True
        

    def deleteLast(self) -> bool:
        """
        Deletes an item from the rear of Deque. Return true if the operation is successful.
        """
        if self.count == 0:return False
        root = self.root
        tail = root.prev
        root.prev = tail.prev
        tail.prev.next = tail.next
        self.count -= 1
        return True
        

    def getFront(self) -> int:
        """
        Get the front item from the deque.
        """
        if not self.isEmpty():
            root = self.root
            node = root.next
            return node.val
        return -1
        

    def getRear(self) -> int:
        """
        Get the last item from the deque.
        """
        if not self.isEmpty():
            root = self.root
            tail = root.prev
            return tail.val
        return -1
        

    def isEmpty(self) -> bool:
        """
        Checks whether the circular deque is empty or not.
        """
        if self.count == 0:return True
        return False

    def isFull(self) -> bool:
        """
        Checks whether the circular deque is full or not.
        """
        if self.count == self.cap:return True
        return False

# 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()