CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-04 19:20:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-04-09 05:12:22 +08:00
parent 01d05cc1f0
commit 37f11aff68
27 changed files with 265 additions and 248 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
chapter_array_and_linkedlist/array.md
View File

@@ -150,7 +150,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
```python title="array.py"
def random_access(nums: list[int]) -> int:
""" 随机访问元素 """
"""随机访问元素"""
# 在区间 [0, len(nums)-1] 中随机抽取一个数字
random_index = random.randint(0, len(nums) - 1)
# 获取并返回随机元素
@@ -286,7 +286,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
```python title="array.py"
def extend(nums: list[int], enlarge: int) -> list[int]:
""" 扩展数组长度 """
"""扩展数组长度"""
# 初始化一个扩展长度后的数组
res = [0] * (len(nums) + enlarge)
# 将原数组中的所有元素复制到新数组
@@ -441,7 +441,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
```python title="array.py"
def insert(nums: list[int], num: int, index: int) -> None:
""" 在数组的索引 index 处插入元素 num """
"""在数组的索引 index 处插入元素 num"""
# 把索引 index 以及之后的所有元素向后移动一位
for i in range(len(nums) - 1, index, -1):
nums[i] = nums[i - 1]
@@ -561,7 +561,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
```python title="array.py"
def remove(nums: list[int], index: int) -> None:
""" 删除索引 index 处元素 """
"""删除索引 index 处元素"""
# 把索引 index 之后的所有元素向前移动一位
for i in range(index, len(nums) - 1):
nums[i] = nums[i + 1]
@@ -693,7 +693,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
```python title="array.py"
def traverse(nums: list[int]) -> None:
""" 遍历数组 """
"""遍历数组"""
count = 0
# 通过索引遍历数组
for i in range(len(nums)):
@@ -849,7 +849,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
```python title="array.py"
def find(nums: list[int], target: int) -> int:
""" 在数组中查找指定元素 """
"""在数组中查找指定元素"""
for i in range(len(nums)):
if nums[i] == target:
return i