hello-algo/codes/python/chapter_stack_and_queue
beintentional 3858048d0f
更新队列的链表实现中 self.__front 判空的方式 (#297)
* 更新队列的链表实现中 self.__front 判空的方式

self.__front 初始化为 None, 元素入队判断队列是否为空,延用头节点的初始化值 None 而不是 0

* Update linkedlist_queue.py

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-01-28 00:30:37 +08:00
..
array_queue.py 1. Add array representation of binary tree. 2022-12-23 00:44:40 +08:00
array_stack.py 1. Add array representation of binary tree. 2022-12-23 00:44:40 +08:00
deque.py 1. Add array representation of binary tree. 2022-12-23 00:44:40 +08:00
linkedlist_queue.py 更新队列的链表实现中 self.__front 判空的方式 (#297) 2023-01-28 00:30:37 +08:00
linkedlist_stack.py 1. Add array representation of binary tree. 2022-12-23 00:44:40 +08:00
queue.py 1. Add array representation of binary tree. 2022-12-23 00:44:40 +08:00
stack.py 1. Add array representation of binary tree. 2022-12-23 00:44:40 +08:00