ehlxr/hello-algo
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update stack and queue.

Browse Source
This commit is contained in:
Yudong Jin
2022-11-30 02:27:26 +08:00
parent 53cc651af2
commit 8669e06414
24 changed files with 705 additions and 186 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
codes/python/chapter_stack_and_queue/array_stack.py
View File

@@ -38,7 +38,7 @@ class ArrayStack:
return self.__stack[index]
""" 返回列表用于打印 """
def toList(self):
def to_list(self):
return self.__stack
@@ -53,7 +53,7 @@ if __name__ == "__main__":
stack.push(2)
stack.push(5)
stack.push(4)
print("栈 stack =", stack.toList())
print("栈 stack =", stack.to_list())
""" 访问栈顶元素 """
peek = stack.peek()
@@ -62,11 +62,12 @@ if __name__ == "__main__":
""" 元素出栈 """
pop = stack.pop()
print("出栈元素 pop =", pop)
print("出栈后 stack =", stack.toList())
print("出栈后 stack =", stack.to_list())
""" 获取栈的长度 """
size = stack.size()
print("栈的长度 size =", size)
""" 判断是否为空 """
isEmpty = stack.is_empty()
is_empty = stack.is_empty()
print("栈是否为空 =", is_empty)

23
codes/python/chapter_stack_and_queue/linkedlist_stack.py
View File

@@ -11,7 +11,7 @@ from include import *
""" 基于链表实现的栈 """
class LinkedListStack:
def __init__(self):
self.__head = None
self.__peek = None
self.__size = 0
""" 获取栈的长度 """
@@ -20,34 +20,34 @@ class LinkedListStack:
""" 判断栈是否为空 """
def is_empty(self):
return not self.__head
return not self.__peek
""" 入栈 """
def push(self, val):
node = ListNode(val)
node.next = self.__head
self.__head = node
node.next = self.__peek
self.__peek = node
self.__size += 1
""" 出栈 """
def pop(self):
# 判空处理
if not self.__head: return None
pop = self.__head.val
self.__head = self.__head.next
if not self.__peek: return None
pop = self.__peek.val
self.__peek = self.__peek.next
self.__size -= 1
return pop
""" 访问栈顶元素 """
def peek(self):
# 判空处理
if not self.__head: return None
return self.__head.val
if not self.__peek: return None
return self.__peek.val
""" 转化为列表用于打印 """
def to_list(self):
arr = []
node = self.__head
node = self.__peek
while node:
arr.append(node.val)
node = node.next
@@ -82,4 +82,5 @@ if __name__ == "__main__":
print("栈的长度 size =", size)
""" 判断是否为空 """
isEmpty = stack.is_empty()
is_empty = stack.is_empty()
print("栈是否为空 =", is_empty)

3
codes/python/chapter_stack_and_queue/stack.py
View File

@@ -37,4 +37,5 @@ if __name__ == "__main__":
print("栈的长度 size =", size)
""" 判断是否为空 """
isEmpty = len(stack) == 0
is_empty = len(stack) == 0
print("栈是否为空 =", is_empty)