栈
栈结构
模拟栈结构
stack = []
stack.append("A")
print(stack)
stack.append("B")
print(stack)
stack.append("C")
print(stack)
res = stack.pop()
print("res = ", res)
print(stack)
res2 = stack.pop()
print("res2 = ", res2)
print(stack)
res3 = stack.pop()
print("res3 = ", res3)
print(stack)
队列
![ABC依次进队,出队时顺序为ABC](https://img-blog.csdnimg.cn/5c49407f5586405e9af57dd557446999.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAdmFuZmFudmFu,size_20,color_FFFFFF,t_70,g_se,x_16#pic_center)
import collections
queue = collections.deque()
print(queue)
queue.append("A")
print(queue)
queue.append("B")
print(queue)
queue.append("C")
print(queue)
res1 = queue.popleft()
print("res1 = ", res1)
print(queue)
res2 = queue.popleft()
print("res2 = ", res2)
print(queue)
res3 = queue.popleft()
print("res1 = ", res3)
print(queue)