day5_python实现栈和队列

栈的实现

# 栈
class Stack:
    def __init__(self):
        self.stack = []

    # 入栈
    def push(self, num):
        self.stack.append(num)

    # 弹栈
    def pop(self):
        self.stack.pop()

    # 栈空
    def empty(self):
        return self.stack == []

    # 获取栈顶元素
    def top(self):
        if self.empty():
            return "empty"
        else:
            return self.stack[-1]

    # 栈大小
    def size(self):
        return len(self.stack)


if __name__ == '__main__':
    stack = Stack()
    stack.push(1)
    stack.push(2)
    stack.push(3)
    print(stack.stack)
    print(stack.top())
    print(stack.size())
    print(stack.empty())
    stack.pop()
    print(stack.stack)

队列的实现

	# deque 类似列表容器，可以在两端快速 插入和删除
    from collections import deque

    # 队列
    queue = deque(["zhangsan", "lisi", "wangwu"])
    # 增(队尾)
    queue.append("zuo")
    print(queue)
    # 删（队头）
    queue.popleft()
    print(queue)
    # 改
    queue[0] = "shi"
    print(queue)
    # 查
    print(queue[1])