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

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)