棧:先進後出,後進先出
# 模擬棧結構
stack = []
# 壓棧(向棧內存數據)
stack.append('A')
print(stack)
stack.append('B')
print(stack)
stack.append('c')
print(stack)
# 出棧(在棧取數據)
c = stack.pop()
print('出棧'+c)
print(stack)
b = stack.pop()
print('出棧'+b)
print(stack)
a = stack.pop()
print('出棧'+a)
print(stack)
隊列:
先進先出
後進後出
import collections # 這個庫提供了額外的數據類型
queue = collections.deque()
print(queue)
# 進隊
queue.append('a')
print(queue)
queue.append('b')
print(queue)
queue.append('c')
print(queue)
# 出隊
a = queue.popleft()
print(a)
print(queue)
b = queue.popleft()
print(b)
print(queue)
c = queue.popleft()
print(c)
print(queue)