栈的实现
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)
队列的实现
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])