CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-07 12:53:55 +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

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

@@ -4,11 +4,7 @@ Created Time: 2022-11-26
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 binary_search(nums: List[int], target: int) -> int:
def binary_search(nums: list[int], target: int) -> int:
""" 二分查找（双闭区间） """
# 初始化双闭区间 [0, n-1] ，即 i, j 分别指向数组首元素、尾元素
i, j = 0, len(nums) - 1
@@ -23,7 +19,7 @@ def binary_search(nums: List[int], target: int) -> int:
return -1 # 未找到目标元素，返回 -1
def binary_search1(nums: List[int], target: int) -> int:
def binary_search1(nums: list[int], target: int) -> int:
""" 二分查找（左闭右开） """
# 初始化左闭右开 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1
i, j = 0, len(nums)
@@ -42,7 +38,7 @@ def binary_search1(nums: List[int], target: int) -> int:
""" Driver Code """
if __name__ == '__main__':
target: int = 6
nums: List[int] = [1, 3, 6, 8, 12, 15, 23, 67, 70, 92]
nums: list[int] = [1, 3, 6, 8, 12, 15, 23, 67, 70, 92]
# 二分查找（双闭区间）
index: int = binary_search(nums, target)

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

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

8
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: List[int], target: int) -> int:
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: List[int], target: int) -> int:
return i
return -1 # 未找到目标元素，返回 -1
def linear_search_linkedlist(head: ListNode, target: int) -> Optional[ListNode]:
def linear_search_linkedlist(head: ListNode, target: int) -> ListNode | None:
""" 线性查找（链表） """
# 遍历链表
while head:
@@ -31,11 +31,11 @@ if __name__ == '__main__':
target: int = 3
# 在数组中执行线性查找
nums: List[int] = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
nums: list[int] = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
index: int = linear_search_array(nums, target)
print("目标元素 3 的索引 =", index)
# 在链表中执行线性查找
head: ListNode = list_to_linked_list(nums)
node: Optional[ListNode] = linear_search_linkedlist(head, target)
node: ListNode | None = linear_search_linkedlist(head, target)
print("目标结点值 3 的对应结点对象为", node)