algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-07 15:01:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add python code of chapter queue to docs.

Browse Source
This commit is contained in:
Yudong Jin
2022-12-02 00:09:34 +08:00
parent 460d42ae3d
commit e20bc251f5
18 changed files with 276 additions and 134 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
codes/python/chapter_stack_and_queue/deque.py
View File

@ -12,36 +12,38 @@ from include import *
from collections import deque
""" Driver Code """
if __name__ == "__main__":
""" 初始化双向队列 """
duque = deque()
""" 元素入队 """
duque.append(2) # 添加至队尾
duque.append(2) # 添加至队尾
duque.append(5)
duque.append(4)
duque.appendleft(3) # 添加至队首
duque.appendleft(1)
print("双向队列 duque = ", duque)
print("双向队列 duque =", duque)
""" 访问队首元素 """
peekFirst = duque[0] # 队首元素
print("队首元素 peekFirst = ", peekFirst)
peekLast = duque[-1] # 队尾元素
print("队尾元素 peekLast = ", peekLast)
front = duque[0] # 队首元素
print("队首元素 front =", front)
rear = duque[-1] # 队尾元素
print("队尾元素 rear =", rear)
""" 元素出队 """
popFirst = duque.pop() # 队首元素出队
print("队首出队元素 popFirst= ", popFirst)
print("队首出队后 duque = ", duque)
popLast = duque.popleft() # 队尾元素出队
print("队尾出队元素 popLast= ", popLast)
print("队尾出队后 duque = ", duque)
pop_front = duque.popleft() # 队首元素出队
print("队首出队元素 pop_front =", pop_front)
print("队首出队后 duque =", duque)
pop_rear = duque.pop() # 队尾元素出队
print("队尾出队元素 pop_rear =", pop_rear)
print("队尾出队后 duque =", duque)
""" 获取双向队列的长度 """
size = len(duque)
print("双向队列长度 size = ", size)
print("双向队列长度 size =", size)
""" 判断双向队列是否为空 """
is_empty = len(duque) == 0
print("双向队列是否为空 = ", is_empty)
print("双向队列是否为空 =", is_empty)