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

50
codes/python/chapter_array_and_linkedlist/my_list.py
View File

@@ -12,64 +12,64 @@ from include import *
class MyList:
""" 构造函数 """
def __init__(self):
self._capacity = 10 # 列表容量
self._nums = [0] * self._capacity # 数组（存储列表元素）
self._size = 0 # 列表长度（即当前元素数量）
self._extend_ratio = 2 # 每次列表扩容的倍数
self.__capacity = 10 # 列表容量
self.__nums = [0] * self.__capacity # 数组（存储列表元素）
self.__size = 0 # 列表长度（即当前元素数量）
self.__extend_ratio = 2 # 每次列表扩容的倍数
""" 获取列表长度（即当前元素数量） """
def size(self):
return self._size
return self.__size
""" 获取列表容量 """
def capacity(self):
return self._capacity
return self.__capacity
""" 访问元素 """
def get(self, index):
# 索引如果越界则抛出异常，下同
assert index < self._size, "索引越界"
return self._nums[index]
assert index < self.__size, "索引越界"
return self.__nums[index]
""" 更新元素 """
def set(self, num, index):
assert index < self._size, "索引越界"
self._nums[index] = num
assert index < self.__size, "索引越界"
self.__nums[index] = num
""" 中间插入元素 """
def add(self, num, index=-1):
assert index < self._size, "索引越界"
assert index < self.__size, "索引越界"
if index == -1:
index = self._size
index = self.__size
# 元素数量超出容量时，触发扩容机制
if self._size == self.capacity():
if self.__size == self.capacity():
self.extend_capacity()
# 索引 i 以及之后的元素都向后移动一位
for j in range(self._size - 1, index - 1, -1):
self._nums[j + 1] = self._nums[j]
self._nums[index] = num
for j in range(self.__size - 1, index - 1, -1):
self.__nums[j + 1] = self.__nums[j]
self.__nums[index] = num
# 更新元素数量
self._size += 1
self.__size += 1
""" 删除元素 """
def remove(self, index):
assert index < self._size, "索引越界"
assert index < self.__size, "索引越界"
# 索引 i 之后的元素都向前移动一位
for j in range(index, self._size - 1):
self._nums[j] = self._nums[j + 1]
for j in range(index, self.__size - 1):
self.__nums[j] = self.__nums[j + 1]
# 更新元素数量
self._size -= 1
self.__size -= 1
""" 列表扩容 """
def extend_capacity(self):
# 新建一个长度为 self._size 的数组，并将原数组拷贝到新数组
self._nums = self._nums + [0] * self.capacity() * (self._extend_ratio - 1)
# 新建一个长度为 self.__size 的数组，并将原数组拷贝到新数组
self.__nums = self.__nums + [0] * self.capacity() * (self.__extend_ratio - 1)
# 更新列表容量
self._capacity = len(self._nums)
self.__capacity = len(self.__nums)
""" 返回有效长度的列表 """
def to_array(self):
return self._nums[:self._size]
return self.__nums[:self.__size]
""" Driver Code """

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)