hello-algo/codes/python/chapter_searching/linear_search.py

42 lines
1.3 KiB
Python
Raw Normal View History

"""
File: linear_search.py
2022-12-03 22:54:19 +08:00
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__))))
2023-03-03 03:07:22 +08:00
from modules import *
def linear_search_array(nums: list[int], target: int) -> int:
2023-03-03 03:07:22 +08:00
""" 线性查找(数组) """
2022-12-03 22:54:19 +08:00
# 遍历数组
for i in range(len(nums)):
if nums[i] == target: # 找到目标元素,返回其索引
2022-12-03 22:54:19 +08:00
return i
return -1 # 未找到目标元素,返回 -1
2022-12-03 22:54:19 +08:00
def linear_search_linkedlist(head: ListNode, target: int) -> ListNode | None:
2023-03-03 03:07:22 +08:00
""" 线性查找(链表) """
2022-12-03 22:54:19 +08:00
# 遍历链表
while head:
if head.val == target: # 找到目标结点,返回之
return head
head = head.next
return None # 未找到目标结点,返回 None
2022-12-03 22:54:19 +08:00
""" Driver Code """
if __name__ == '__main__':
target: int = 3
2022-12-03 22:54:19 +08:00
# 在数组中执行线性查找
nums: list[int] = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
index: int = linear_search_array(nums, target)
print("目标元素 3 的索引 =", index)
2022-12-03 22:54:19 +08:00
# 在链表中执行线性查找
head: ListNode = list_to_linked_list(nums)
node: ListNode | None = linear_search_linkedlist(head, target)
print("目标结点值 3 的对应结点对象为", node)