xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-10 22:46:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-03-12 18:46:03 +08:00
parent 209d82a8cc
commit f6b9a75c8f
23 changed files with 406 additions and 359 deletions
Download Patch File Download Diff File Expand all files Collapse all files
chapter_array_and_linkedlist/array.md
+8 -8
View File
@@ -40,8 +40,8 @@ comments: true
```python title="array.py"
""" 初始化数组 """
arr = [0] * 5 # [ 0, 0, 0, 0, 0 ]
nums = [1, 3, 2, 5, 4]
arr: List[int] = [0] * 5 # [ 0, 0, 0, 0, 0 ]
nums: List[int] = [1, 3, 2, 5, 4]
```
=== "Go"
@@ -149,7 +149,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "Python"
```python title="array.py"
def random_access(nums):
def random_access(nums: List[int]) -> int:
""" 随机访问元素 """
# 在区间 [0, len(nums)-1] 中随机抽取一个数字
random_index = random.randint(0, len(nums) - 1)
@@ -285,7 +285,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "Python"
```python title="array.py"
def extend(nums, enlarge):
def extend(nums: List[int], enlarge: int) -> List[int]:
""" 扩展数组长度 """
# 初始化一个扩展长度后的数组
res = [0] * (len(nums) + enlarge)
@@ -440,7 +440,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "Python"
```python title="array.py"
def insert(nums, num, index):
def insert(nums: List[int], num: int, index: int) -> None:
""" 在数组的索引 index 处插入元素 num """
# 把索引 index 以及之后的所有元素向后移动一位
for i in range(len(nums) - 1, index, -1):
@@ -560,7 +560,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "Python"
```python title="array.py"
def remove(nums, index):
def remove(nums: List[int], index: int) -> None:
""" 删除索引 index 处元素 """
# 把索引 index 之后的所有元素向前移动一位
for i in range(index, len(nums) - 1):
@@ -692,7 +692,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "Python"
```python title="array.py"
def traverse(nums):
def traverse(nums: List[int]) -> None:
""" 遍历数组 """
count = 0
# 通过索引遍历数组
@@ -848,7 +848,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "Python"
```python title="array.py"
def find(nums, target):
def find(nums: List[int], target: int) -> int:
""" 在数组中查找指定元素 """
for i in range(len(nums)):
if nums[i] == target:
chapter_array_and_linkedlist/linked_list.md
+11 -11
View File
@@ -43,9 +43,9 @@ comments: true
```python title=""
""" 链表结点类 """
class ListNode:
def __init__(self, x):
self.val = x # 结点值
self.next = None # 指向下一结点的指针（引用）
def __init__(self, val: int):
self.val: int = val # 结点值
self.next: Optional[ListNode] = None # 指向下一结点的指针（引用）
```
=== "Go"
@@ -351,7 +351,7 @@ comments: true
=== "Python"
```python title="linked_list.py"
def insert(n0, P):
def insert(n0: ListNode, P: ListNode) -> None:
""" 在链表的结点 n0 之后插入结点 P """
n1 = n0.next
P.next = n1
@@ -470,7 +470,7 @@ comments: true
=== "Python"
```python title="linked_list.py"
def remove(n0):
def remove(n0: ListNode) -> None:
""" 删除链表的结点 n0 之后的首个结点 """
if not n0.next:
return
@@ -609,7 +609,7 @@ comments: true
=== "Python"
```python title="linked_list.py"
def access(head, index):
def access(head: ListNode, index: int) -> Optional[ListNode]:
""" 访问链表中索引为 index 的结点 """
for _ in range(index):
if not head:
@@ -757,7 +757,7 @@ comments: true
=== "Python"
```python title="linked_list.py"
def find(head, target):
def find(head: ListNode, target: int) -> int:
""" 在链表中查找值为 target 的首个结点 """
index = 0
while head:
@@ -914,10 +914,10 @@ comments: true
```python title=""
""" 双向链表结点类 """
class ListNode:
def __init__(self, x):
self.val = x # 结点值
self.next = None # 指向后继结点的指针（引用）
self.prev = None # 指向前驱结点的指针（引用）
def __init__(self, val: int):
self.val: int = val # 结点值
self.next: Optional[ListNode] = None # 指向后继结点的指针（引用）
self.prev: Optional[ListNode] = None # 指向前驱结点的指针（引用）
```
=== "Go"
chapter_array_and_linkedlist/list.md
+19 -19
View File
@@ -39,9 +39,9 @@ comments: true
```python title="list.py"
""" 初始化列表 """
# 无初始值
list1 = []
list1: List[int] = []
# 有初始值
list = [1, 3, 2, 5, 4]
list: List[int] = [1, 3, 2, 5, 4]
```
=== "Go"
@@ -136,7 +136,7 @@ comments: true
```python title="list.py"
""" 访问元素 """
num = list[1] # 访问索引 1 处的元素
num: int = list[1] # 访问索引 1 处的元素
""" 更新元素 """
list[1] = 0 # 将索引 1 处的元素更新为 0
@@ -434,12 +434,12 @@ comments: true
```python title="list.py"
""" 通过索引遍历列表 """
count = 0
count: int = 0
for i in range(len(list)):
count += 1
""" 直接遍历列表元素 """
count = 0
count: int = 0
for n in list:
count += 1
```
@@ -572,7 +572,7 @@ comments: true
```python title="list.py"
""" 拼接两个列表 """
list1 = [6, 8, 7, 10, 9]
list1: List[int] = [6, 8, 7, 10, 9]
list += list1 # 将列表 list1 拼接到 list 之后
```
@@ -937,31 +937,31 @@ comments: true
""" 列表类简易实现 """
def __init__(self):
""" 构造方法 """
self.__capacity = 10 # 列表容量
self.__nums = [0] * self.__capacity # 数组（存储列表元素）
self.__size = 0 # 列表长度（即当前元素数量）
self.__extend_ratio = 2 # 每次列表扩容的倍数
self.__capacity: int = 10 # 列表容量
self.__nums: List[int] = [0] * self.__capacity # 数组（存储列表元素）
self.__size: int = 0 # 列表长度（即当前元素数量）
self.__extend_ratio: int = 2 # 每次列表扩容的倍数
def size(self):
def size(self) -> int:
""" 获取列表长度（即当前元素数量） """
return self.__size
def capacity(self):
def capacity(self) -> int:
""" 获取列表容量 """
return self.__capacity
def get(self, index):
def get(self, index: int) -> int:
""" 访问元素 """
# 索引如果越界则抛出异常，下同
assert index >= 0 and index < self.__size, "索引越界"
return self.__nums[index]
def set(self, num, index):
def set(self, num: int, index: int) -> None:
""" 更新元素 """
assert index >= 0 and index < self.__size, "索引越界"
self.__nums[index] = num
def add(self, num):
def add(self, num: int) -> None:
""" 尾部添加元素 """
# 元素数量超出容量时，触发扩容机制
if self.size() == self.capacity():
@@ -969,7 +969,7 @@ comments: true
self.__nums[self.__size] = num
self.__size += 1
def insert(self, num, index):
def insert(self, num: int, index: int) -> None:
""" 中间插入元素 """
assert index >= 0 and index < self.__size, "索引越界"
# 元素数量超出容量时，触发扩容机制
@@ -982,7 +982,7 @@ comments: true
# 更新元素数量
self.__size += 1
def remove(self, index):
def remove(self, index: int) -> int:
""" 删除元素 """
assert index >= 0 and index < self.__size, "索引越界"
num = self.__nums[index]
@@ -994,14 +994,14 @@ comments: true
# 返回被删除元素
return num
def extend_capacity(self):
def extend_capacity(self) -> None:
""" 列表扩容 """
# 新建一个长度为 self.__size 的数组，并将原数组拷贝到新数组
self.__nums = self.__nums + [0] * self.capacity() * (self.__extend_ratio - 1)
# 更新列表容量
self.__capacity = len(self.__nums)
def to_array(self):
def to_array(self) -> List[int]:
""" 返回有效长度的列表 """
return self.__nums[:self.__size]
```