【稳住，can win】Python栈和队列简易实现

【稳住，can win】Python栈和队列简易实现 栈

class Stack():
    def __init__(self):
        self.data = []

    def top(self):
        size = len(self.data)
        if size <= 0:
            return
        return self.data[size - 1]

    def push(self, e):
        self.data.append(e)


    def pop(self):
        return self.data.pop()

        

队列 单端队列

class Queue():
    def __init__(self):
        self.data = []
        
    def enqueue(self, e):
        self.data.insert(0, e)
        
    def dequeue(self):
        return self.data.pop()

双端队列

class Deque():
    def __init__(self):
        self.data = []

    def add_front(self, e):
        self.data.insert(0,e)

    def add_rear(self, e):
        self.data.append(e)

    def remove_front(self):
        return self.data.pop(0)


    def remove_rear(self):
        return self.data.pop()