Remove -> None for Python functions

codes/python/chapter_sorting/bubble_sort.py

@@ -5,7 +5,7 @@ Author: timi (xisunyy@163.com)
 """
 
 
-def bubble_sort(nums: list[int]) -> None:
+def bubble_sort(nums: list[int]):
     """冒泡排序"""
     n = len(nums)
     # 外循环：未排序区间为 [0, i]
@@ -17,7 +17,7 @@ def bubble_sort(nums: list[int]) -> None:
                 nums[j], nums[j + 1] = nums[j + 1], nums[j]
 
 
-def bubble_sort_with_flag(nums: list[int]) -> None:
+def bubble_sort_with_flag(nums: list[int]):
     """冒泡排序（标志优化）"""
     n = len(nums)
     # 外循环：未排序区间为 [0, i]

codes/python/chapter_sorting/bucket_sort.py

@@ -5,7 +5,7 @@ Author: Krahets (krahets@163.com)
 """
 
 
-def bucket_sort(nums: list[float]) -> None:
+def bucket_sort(nums: list[float]):
     """桶排序"""
     # 初始化 k = n/2 个桶，预期向每个桶分配 2 个元素
     k = len(nums) // 2

codes/python/chapter_sorting/counting_sort.py

@@ -5,7 +5,7 @@ Author: Krahets (krahets@163.com)
 """
 
 
-def counting_sort_naive(nums: list[int]) -> None:
+def counting_sort_naive(nums: list[int]):
     """计数排序"""
     # 简单实现，无法用于排序对象
     # 1. 统计数组最大元素 m
@@ -25,7 +25,7 @@ def counting_sort_naive(nums: list[int]) -> None:
             i += 1
 
 
-def counting_sort(nums: list[int]) -> None:
+def counting_sort(nums: list[int]):
     """计数排序"""
     # 完整实现，可排序对象，并且是稳定排序
     # 1. 统计数组最大元素 m

codes/python/chapter_sorting/insertion_sort.py

@@ -5,7 +5,7 @@ Author: timi (xisunyy@163.com)
 """
 
 
-def insertion_sort(nums: list[int]) -> None:
+def insertion_sort(nums: list[int]):
     """插入排序"""
     # 外循环：已排序区间为 [0, i-1]
     for i in range(1, len(nums)):

codes/python/chapter_sorting/merge_sort.py

@@ -5,7 +5,7 @@ Author: timi (xisunyy@163.com)
 """
 
 
-def merge(nums: list[int], left: int, mid: int, right: int) -> None:
+def merge(nums: list[int], left: int, mid: int, right: int):
     """合并左子数组和右子数组"""
     # 左子数组区间 [left, mid]
     # 右子数组区间 [mid + 1, right]
@@ -36,7 +36,7 @@ def merge(nums: list[int], left: int, mid: int, right: int) -> None:
             j += 1
 
 
-def merge_sort(nums: list[int], left: int, right: int) -> None:
+def merge_sort(nums: list[int], left: int, right: int):
     """归并排序"""
     # 终止条件
     if left >= right:

codes/python/chapter_sorting/quick_sort.py

@@ -23,7 +23,7 @@ class QuickSort:
         nums[i], nums[left] = nums[left], nums[i]
         return i  # 返回基准数的索引
 
-    def quick_sort(self, nums: list[int], left: int, right: int) -> None:
+    def quick_sort(self, nums: list[int], left: int, right: int):
         """快速排序"""
         # 子数组长度为 1 时终止递归
         if left >= right:
@@ -67,7 +67,7 @@ class QuickSortMedian:
         nums[i], nums[left] = nums[left], nums[i]
         return i  # 返回基准数的索引
 
-    def quick_sort(self, nums: list[int], left: int, right: int) -> None:
+    def quick_sort(self, nums: list[int], left: int, right: int):
         """快速排序"""
         # 子数组长度为 1 时终止递归
         if left >= right:
@@ -97,7 +97,7 @@ class QuickSortTailCall:
         nums[i], nums[left] = nums[left], nums[i]
         return i  # 返回基准数的索引
 
-    def quick_sort(self, nums: list[int], left: int, right: int) -> None:
+    def quick_sort(self, nums: list[int], left: int, right: int):
         """快速排序（尾递归优化）"""
         # 子数组长度为 1 时终止
         while left < right:

codes/python/chapter_sorting/radix_sort.py

@@ -11,7 +11,7 @@ def digit(num: int, exp: int) -> int:
     return (num // exp) % 10
 
 
-def counting_sort_digit(nums: list[int], exp: int) -> None:
+def counting_sort_digit(nums: list[int], exp: int):
     """计数排序（根据 nums 第 k 位排序）"""
     # 十进制的位范围为 0~9 ，因此需要长度为 10 的桶
     counter = [0] * 10
@@ -35,7 +35,7 @@ def counting_sort_digit(nums: list[int], exp: int) -> None:
         nums[i] = res[i]
 
 
-def radix_sort(nums: list[int]) -> None:
+def radix_sort(nums: list[int]):
     """基数排序"""
     # 获取数组的最大元素，用于判断最大位数
     m = max(nums)