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

Add typing annotations to Python codes. (#411)

Browse Source
This commit is contained in:
Yudong Jin
2023-03-12 18:49:52 +08:00
committed by GitHub
parent 2029d2b939
commit 9151eaf533
50 changed files with 577 additions and 817 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
codes/python/chapter_searching/binary_search.py
View File

@@ -8,7 +8,7 @@ import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def binary_search(nums, target):
def binary_search(nums: List[int], target: int) -> int:
""" 二分查找（双闭区间） """
# 初始化双闭区间 [0, n-1] ，即 i, j 分别指向数组首元素、尾元素
i, j = 0, len(nums) - 1
@@ -23,7 +23,7 @@ def binary_search(nums, target):
return -1 # 未找到目标元素，返回 -1
def binary_search1(nums, target):
def binary_search1(nums: List[int], target: int) -> int:
""" 二分查找（左闭右开） """
# 初始化左闭右开 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1
i, j = 0, len(nums)
@@ -41,13 +41,13 @@ def binary_search1(nums, target):
""" Driver Code """
if __name__ == '__main__':
target = 6
nums = [1, 3, 6, 8, 12, 15, 23, 67, 70, 92]
target: int = 6
nums: List[int] = [1, 3, 6, 8, 12, 15, 23, 67, 70, 92]
# 二分查找（双闭区间）
index = binary_search(nums, target)
index: int = binary_search(nums, target)
print("目标元素 6 的索引 = ", index)
# 二分查找（左闭右开）
index = binary_search1(nums, target)
index: int = binary_search1(nums, target)
print("目标元素 6 的索引 = ", index)

22
codes/python/chapter_searching/hashing_search.py
View File

@@ -8,38 +8,38 @@ import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def hashing_search_array(mapp, target):
def hashing_search_array(mapp: Dict[int, int], target: int) -> int:
""" 哈希查找（数组） """
# 哈希表的 key: 目标元素，value: 索引
# 若哈希表中无此 key ，返回 -1
return mapp.get(target, -1)
def hashing_search_linkedlist(mapp, target):
def hashing_search_linkedlist(mapp: Dict[int, ListNode], target: int) -> Optional[ListNode]:
""" 哈希查找（链表） """
# 哈希表的 key: 目标元素，value: 结点对象
# 若哈希表中无此 key ，返回 -1
return mapp.get(target, -1)
# 若哈希表中无此 key ，返回 None
return mapp.get(target, None)
""" Driver Code """
if __name__ == '__main__':
target = 3
target: int = 3
# 哈希查找（数组）
nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
nums: List[int] = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
# 初始化哈希表
mapp = {}
mapp: Dict[int, int] = {}
for i in range(len(nums)):
mapp[nums[i]] = i # key: 元素，value: 索引
index = hashing_search_array(mapp, target)
index: int = hashing_search_array(mapp, target)
print("目标元素 3 的索引 =", index)
# 哈希查找（链表）
head = list_to_linked_list(nums)
head: ListNode = list_to_linked_list(nums)
# 初始化哈希表
map1 = {}
map1: Dict[int, ListNode] = {}
while head:
map1[head.val] = head # key: 结点值，value: 结点
head = head.next
node = hashing_search_linkedlist(map1, target)
node: ListNode = hashing_search_linkedlist(map1, target)
print("目标结点值 3 的对应结点对象为", node)

14
codes/python/chapter_searching/linear_search.py
View File

@@ -8,7 +8,7 @@ import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
def linear_search_array(nums, target):
def linear_search_array(nums: List[int], target: int) -> int:
""" 线性查找（数组） """
# 遍历数组
for i in range(len(nums)):
@@ -16,7 +16,7 @@ def linear_search_array(nums, target):
return i
return -1 # 未找到目标元素，返回 -1
def linear_search_linkedlist(head, target):
def linear_search_linkedlist(head: ListNode, target: int) -> Optional[ListNode]:
""" 线性查找（链表） """
# 遍历链表
while head:
@@ -28,14 +28,14 @@ def linear_search_linkedlist(head, target):
""" Driver Code """
if __name__ == '__main__':
target = 3
target: int = 3
# 在数组中执行线性查找
nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
index = linear_search_array(nums, target)
nums: List[int] = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
index: int = linear_search_array(nums, target)
print("目标元素 3 的索引 =", index)
# 在链表中执行线性查找
head = list_to_linked_list(nums)
node = linear_search_linkedlist(head, target)
head: ListNode = list_to_linked_list(nums)
node: Optional[ListNode] = linear_search_linkedlist(head, target)
print("目标结点值 3 的对应结点对象为", node)