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

Fix Python code.

Browse Source
This commit is contained in:
krahets
2023-10-14 21:54:47 +08:00
parent a8c624fa5a
commit 2976d9ff56
10 changed files with 174 additions and 170 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
codes/python/chapter_stack_and_queue/array_deque.py
View File

@ -10,21 +10,21 @@ class ArrayDeque:
def __init__(self, capacity: int):
"""构造方法"""
self.__nums: list[int] = [0] * capacity
self.__front: int = 0
self.__size: int = 0
self._nums: list[int] = [0] * capacity
self._front: int = 0
self._size: int = 0
def capacity(self) -> int:
"""获取双向队列的容量"""
return len(self.__nums)
return len(self._nums)
def size(self) -> int:
"""获取双向队列的长度"""
return self.__size
return self._size
def is_empty(self) -> bool:
"""判断双向队列是否为空"""
return self.__size == 0
return self._size == 0
def index(self, i: int) -> int:
"""计算环形数组索引"""
@ -35,61 +35,61 @@ class ArrayDeque:
def push_first(self, num: int):
"""队首入队"""
if self.__size == self.capacity():
if self._size == self.capacity():
print("双向队列已满")
return
# 队首指针向左移动一位
# 通过取余操作，实现 front 越过数组头部后回到尾部
self.__front = self.index(self.__front - 1)
self._front = self.index(self._front - 1)
# 将 num 添加至队首
self.__nums[self.__front] = num
self.__size += 1
self._nums[self._front] = num
self._size += 1
def push_last(self, num: int):
"""队尾入队"""
if self.__size == self.capacity():
if self._size == self.capacity():
print("双向队列已满")
return
# 计算尾指针，指向队尾索引 + 1
rear = self.index(self.__front + self.__size)
rear = self.index(self._front + self._size)
# 将 num 添加至队尾
self.__nums[rear] = num
self.__size += 1
self._nums[rear] = num
self._size += 1
def pop_first(self) -> int:
"""队首出队"""
num = self.peek_first()
# 队首指针向后移动一位
self.__front = self.index(self.__front + 1)
self.__size -= 1
self._front = self.index(self._front + 1)
self._size -= 1
return num
def pop_last(self) -> int:
"""队尾出队"""
num = self.peek_last()
self.__size -= 1
self._size -= 1
return num
def peek_first(self) -> int:
"""访问队首元素"""
if self.is_empty():
raise IndexError("双向队列为空")
return self.__nums[self.__front]
return self._nums[self._front]
def peek_last(self) -> int:
"""访问队尾元素"""
if self.is_empty():
raise IndexError("双向队列为空")
# 计算尾元素索引
last = self.index(self.__front + self.__size - 1)
return self.__nums[last]
last = self.index(self._front + self._size - 1)
return self._nums[last]
def to_array(self) -> list[int]:
"""返回数组用于打印"""
# 仅转换有效长度范围内的列表元素
res = []
for i in range(self.__size):
res.append(self.__nums[self.index(self.__front + i)])
for i in range(self._size):
res.append(self._nums[self.index(self._front + i)])
return res