mirror of
https://github.com/krahets/hello-algo.git
synced 2025-07-11 01:22:51 +08:00
Remove -> None
for Python functions
This commit is contained in:
@ -29,7 +29,7 @@ def extend(nums: list[int], enlarge: int) -> list[int]:
|
||||
return res
|
||||
|
||||
|
||||
def insert(nums: list[int], num: int, index: int) -> None:
|
||||
def insert(nums: list[int], num: int, index: int):
|
||||
"""在数组的索引 index 处插入元素 num"""
|
||||
# 把索引 index 以及之后的所有元素向后移动一位
|
||||
for i in range(len(nums) - 1, index, -1):
|
||||
@ -38,14 +38,14 @@ def insert(nums: list[int], num: int, index: int) -> None:
|
||||
nums[index] = num
|
||||
|
||||
|
||||
def remove(nums: list[int], index: int) -> None:
|
||||
def remove(nums: list[int], index: int):
|
||||
"""删除索引 index 处元素"""
|
||||
# 把索引 index 之后的所有元素向前移动一位
|
||||
for i in range(index, len(nums) - 1):
|
||||
nums[i] = nums[i + 1]
|
||||
|
||||
|
||||
def traverse(nums: list[int]) -> None:
|
||||
def traverse(nums: list[int]):
|
||||
"""遍历数组"""
|
||||
count = 0
|
||||
# 通过索引遍历数组
|
||||
|
@ -10,14 +10,14 @@ sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
|
||||
from modules import *
|
||||
|
||||
|
||||
def insert(n0: ListNode, P: ListNode) -> None:
|
||||
def insert(n0: ListNode, P: ListNode):
|
||||
"""在链表的节点 n0 之后插入节点 P"""
|
||||
n1 = n0.next
|
||||
P.next = n1
|
||||
n0.next = P
|
||||
|
||||
|
||||
def remove(n0: ListNode) -> None:
|
||||
def remove(n0: ListNode):
|
||||
"""删除链表的节点 n0 之后的首个节点"""
|
||||
if not n0.next:
|
||||
return
|
||||
|
@ -30,13 +30,13 @@ class MyList:
|
||||
raise IndexError("索引越界")
|
||||
return self.__nums[index]
|
||||
|
||||
def set(self, num: int, index: int) -> None:
|
||||
def set(self, num: int, index: int):
|
||||
"""更新元素"""
|
||||
if index < 0 or index >= self.__size:
|
||||
raise IndexError("索引越界")
|
||||
self.__nums[index] = num
|
||||
|
||||
def add(self, num: int) -> None:
|
||||
def add(self, num: int):
|
||||
"""尾部添加元素"""
|
||||
# 元素数量超出容量时,触发扩容机制
|
||||
if self.size() == self.capacity():
|
||||
@ -44,7 +44,7 @@ class MyList:
|
||||
self.__nums[self.__size] = num
|
||||
self.__size += 1
|
||||
|
||||
def insert(self, num: int, index: int) -> None:
|
||||
def insert(self, num: int, index: int):
|
||||
"""中间插入元素"""
|
||||
if index < 0 or index >= self.__size:
|
||||
raise IndexError("索引越界")
|
||||
@ -71,7 +71,7 @@ class MyList:
|
||||
# 返回被删除元素
|
||||
return num
|
||||
|
||||
def extend_capacity(self) -> None:
|
||||
def extend_capacity(self):
|
||||
"""列表扩容"""
|
||||
# 新建一个长度为原数组 __extend_ratio 倍的新数组,并将原数组拷贝到新数组
|
||||
self.__nums = self.__nums + [0] * self.capacity() * (self.__extend_ratio - 1)
|
||||
|
Reference in New Issue
Block a user