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

build

Browse Source
This commit is contained in:
krahets
2023-10-14 22:14:46 +08:00
parent c641987cd8
commit eda4539790
8 changed files with 212 additions and 212 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
docs/chapter_array_and_linkedlist/list.md
View File

@ -872,77 +872,77 @@ comments: true
def __init__(self):
"""构造方法"""
self.__capacity: int = 10 # 列表容量
self.__arr: list[int] = [0] * self.__capacity # 数组（存储列表元素）
self.__size: int = 0 # 列表长度（即当前元素数量）
self.__extend_ratio: int = 2 # 每次列表扩容的倍数
self._capacity: int = 10 # 列表容量
self._arr: list[int] = [0] * self._capacity # 数组（存储列表元素）
self._size: int = 0 # 列表长度（即当前元素数量）
self._extend_ratio: int = 2 # 每次列表扩容的倍数
def size(self) -> int:
"""获取列表长度（即当前元素数量）"""
return self.__size
return self._size
def capacity(self) -> int:
"""获取列表容量"""
return self.__capacity
return self._capacity
def get(self, index: int) -> int:
"""访问元素"""
# 索引如果越界则抛出异常，下同
if index < 0 or index >= self.__size:
if index < 0 or index >= self._size:
raise IndexError("索引越界")
return self.__arr[index]
return self._arr[index]
def set(self, num: int, index: int):
"""更新元素"""
if index < 0 or index >= self.__size:
if index < 0 or index >= self._size:
raise IndexError("索引越界")
self.__arr[index] = num
self._arr[index] = num
def add(self, num: int):
"""尾部添加元素"""
# 元素数量超出容量时，触发扩容机制
if self.size() == self.capacity():
self.extend_capacity()
self.__arr[self.__size] = num
self.__size += 1
self._arr[self._size] = num
self._size += 1
def insert(self, num: int, index: int):
"""中间插入元素"""
if index < 0 or index >= self.__size:
if index < 0 or index >= self._size:
raise IndexError("索引越界")
# 元素数量超出容量时，触发扩容机制
if self.__size == self.capacity():
if self._size == self.capacity():
self.extend_capacity()
# 将索引 index 以及之后的元素都向后移动一位
for j in range(self.__size - 1, index - 1, -1):
self.__arr[j + 1] = self.__arr[j]
self.__arr[index] = num
for j in range(self._size - 1, index - 1, -1):
self._arr[j + 1] = self._arr[j]
self._arr[index] = num
# 更新元素数量
self.__size += 1
self._size += 1
def remove(self, index: int) -> int:
"""删除元素"""
if index < 0 or index >= self.__size:
if index < 0 or index >= self._size:
raise IndexError("索引越界")
num = self.__arr[index]
num = self._arr[index]
# 索引 i 之后的元素都向前移动一位
for j in range(index, self.__size - 1):
self.__arr[j] = self.__arr[j + 1]
for j in range(index, self._size - 1):
self._arr[j] = self._arr[j + 1]
# 更新元素数量
self.__size -= 1
self._size -= 1
# 返回被删除元素
return num
def extend_capacity(self):
"""列表扩容"""
# 新建一个长度为原数组 __extend_ratio 倍的新数组，并将原数组拷贝到新数组
self.__arr = self.__arr + [0] * self.capacity() * (self.__extend_ratio - 1)
self._arr = self._arr + [0] * self.capacity() * (self._extend_ratio - 1)
# 更新列表容量
self.__capacity = len(self.__arr)
self._capacity = len(self._arr)
def to_array(self) -> list[int]:
"""返回有效长度的列表"""
return self.__arr[: self.__size]
return self._arr[: self._size]
```
=== "C++"