algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Follow the PEP 585 Typing standard (#439)

Browse Source 
* Follow the PEP 585 Typing standard

* Update list.py
This commit is contained in:
Yudong Jin
2023-03-23 18:51:56 +08:00
committed by GitHub
parent f4e01ea32e
commit 8918ec9079
43 changed files with 256 additions and 342 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/python/chapter_sorting/bubble_sort.py
View File

@@ -4,11 +4,7 @@ Created Time: 2022-11-25
Author: timi (xisunyy@163.com)
"""
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def bubble_sort(nums: List[int]) -> None:
def bubble_sort(nums: list[int]) -> None:
""" 冒泡排序 """
n: int = len(nums)
# 外循环：待排序元素数量为 n-1, n-2, ..., 1
@@ -19,7 +15,7 @@ def bubble_sort(nums: List[int]) -> None:
# 交换 nums[j] 与 nums[j + 1]
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]) -> None:
""" 冒泡排序（标志优化） """
n: int = len(nums)
# 外循环：待排序元素数量为 n-1, n-2, ..., 1
@@ -37,10 +33,10 @@ def bubble_sort_with_flag(nums: List[int]) -> None:
""" Driver Code """
if __name__ == '__main__':
nums: List[int] = [4, 1, 3, 1, 5, 2]
nums: list[int] = [4, 1, 3, 1, 5, 2]
bubble_sort(nums)
print("排序后数组 nums =", nums)
nums1: List[int] = [4, 1, 3, 1, 5, 2]
nums1: list[int] = [4, 1, 3, 1, 5, 2]
bubble_sort_with_flag(nums1)
print("排序后数组 nums =", nums1)

8
codes/python/chapter_sorting/counting_sort.py
View File

@@ -4,11 +4,7 @@ Created Time: 2023-03-21
Author: Krahets (krahets@163.com)
"""
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def counting_sort_naive(nums: List[int]) -> None:
def counting_sort_naive(nums: list[int]) -> None:
""" 计数排序 """
# 简单实现，无法用于排序对象
# 1. 统计数组最大元素 m
@@ -27,7 +23,7 @@ def counting_sort_naive(nums: List[int]) -> None:
nums[i] = num
i += 1
def counting_sort(nums: List[int]) -> None:
def counting_sort(nums: list[int]) -> None:
""" 计数排序 """
# 完整实现，可排序对象，并且是稳定排序
# 1. 统计数组最大元素 m

8
codes/python/chapter_sorting/insertion_sort.py
View File

@@ -4,11 +4,7 @@ Created Time: 2022-11-25
Author: timi (xisunyy@163.com)
"""
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def insertion_sort(nums: List[int]) -> None:
def insertion_sort(nums: list[int]) -> None:
""" 插入排序 """
# 外循环：base = nums[1], nums[2], ..., nums[n-1]
for i in range(1, len(nums)):
@@ -23,6 +19,6 @@ def insertion_sort(nums: List[int]) -> None:
""" Driver Code """
if __name__ == '__main__':
nums: List[int] = [4, 1, 3, 1, 5, 2]
nums: list[int] = [4, 1, 3, 1, 5, 2]
insertion_sort(nums)
print("排序后数组 nums =", nums)

14
codes/python/chapter_sorting/merge_sort.py
View File

@@ -4,16 +4,12 @@ Created Time: 2022-11-25
Author: timi (xisunyy@163.com)
"""
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def merge(nums: List[int], left: int, mid: int, right: int) -> None:
def merge(nums: list[int], left: int, mid: int, right: int) -> None:
""" 合并左子数组和右子数组 """
# 左子数组区间 [left, mid]
# 右子数组区间 [mid + 1, right]
# 初始化辅助数组 借助 copy模块
tmp: List[int] = nums[left:right + 1].copy()
# 初始化辅助数组
tmp: list[int] = list(nums[left:right + 1])
# 左子数组的起始索引和结束索引
left_start: int = 0
left_end: int = mid - left
@@ -38,7 +34,7 @@ def merge(nums: List[int], left: int, mid: int, right: int) -> None:
nums[k] = tmp[j]
j += 1
def merge_sort(nums: List[int], left: int, right: int) -> None:
def merge_sort(nums: list[int], left: int, right: int) -> None:
""" 归并排序 """
# 终止条件
if left >= right:
@@ -53,6 +49,6 @@ def merge_sort(nums: List[int], left: int, right: int) -> None:
""" Driver Code """
if __name__ == '__main__':
nums: List[int] = [ 7, 3, 2, 6, 0, 1, 5, 4 ]
nums: list[int] = [ 7, 3, 2, 6, 0, 1, 5, 4 ]
merge_sort(nums, 0, len(nums) - 1)
print("归并排序完成后 nums =", nums)

24
codes/python/chapter_sorting/quick_sort.py
View File

@@ -4,13 +4,9 @@ Created Time: 2022-11-25
Author: timi (xisunyy@163.com)
"""
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
class QuickSort:
""" 快速排序类 """
def partition(self, nums: List[int], left: int, right: int) -> int:
def partition(self, nums: list[int], left: int, right: int) -> int:
""" 哨兵划分 """
# 以 nums[left] 作为基准数
i, j = left, right
@@ -25,7 +21,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) -> None:
""" 快速排序 """
# 子数组长度为 1 时终止递归
if left >= right:
@@ -38,7 +34,7 @@ class QuickSort:
class QuickSortMedian:
""" 快速排序类（中位基准数优化）"""
def median_three(self, nums: List[int], left: int, mid: int, right: int) -> int:
def median_three(self, nums: list[int], left: int, mid: int, right: int) -> int:
""" 选取三个元素的中位数 """
# 此处使用异或运算来简化代码
# 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
@@ -48,7 +44,7 @@ class QuickSortMedian:
return mid
return right
def partition(self, nums: List[int], left: int, right: int) -> int:
def partition(self, nums: list[int], left: int, right: int) -> int:
""" 哨兵划分（三数取中值） """
# 以 nums[left] 作为基准数
med: int = self.median_three(nums, left, (left + right) // 2, right)
@@ -67,7 +63,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) -> None:
""" 快速排序 """
# 子数组长度为 1 时终止递归
if left >= right:
@@ -80,7 +76,7 @@ class QuickSortMedian:
class QuickSortTailCall:
""" 快速排序类（尾递归优化） """
def partition(self, nums: List[int], left: int, right: int) -> int:
def partition(self, nums: list[int], left: int, right: int) -> int:
""" 哨兵划分 """
# 以 nums[left] 作为基准数
i, j = left, right
@@ -95,7 +91,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) -> None:
""" 快速排序（尾递归优化） """
# 子数组长度为 1 时终止
while left < right:
@@ -113,16 +109,16 @@ class QuickSortTailCall:
""" Driver Code """
if __name__ == '__main__':
# 快速排序
nums: List[int] = [2, 4, 1, 0, 3, 5]
nums: list[int] = [2, 4, 1, 0, 3, 5]
QuickSort().quick_sort(nums, 0, len(nums) - 1)
print("快速排序完成后 nums =", nums)
# 快速排序（中位基准数优化）
nums1: List[int] = [2, 4, 1, 0, 3, 5]
nums1: list[int] = [2, 4, 1, 0, 3, 5]
QuickSortMedian().quick_sort(nums1, 0, len(nums1) - 1)
print("快速排序（中位基准数优化）完成后 nums =", nums1)
# 快速排序（尾递归优化）
nums2: List[int] = [2, 4, 1, 0, 3, 5]
nums2: list[int] = [2, 4, 1, 0, 3, 5]
QuickSortTailCall().quick_sort(nums2, 0, len(nums2) - 1)
print("快速排序（尾递归优化）完成后 nums =", nums2)