mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-10 16:00:36 +08:00
14c314c08c
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
46 lines
1.3 KiB
Python
46 lines
1.3 KiB
Python
"""
|
|
File: linear_search.py
|
|
Created Time: 2022-11-26
|
|
Author: timi (xisunyy@163.com)
|
|
"""
|
|
|
|
import sys
|
|
from pathlib import Path
|
|
|
|
sys.path.append(str(Path(__file__).parent.parent))
|
|
from modules import ListNode, list_to_linked_list
|
|
|
|
|
|
def linear_search_array(nums: list[int], target: int) -> int:
|
|
"""Linear search (array)"""
|
|
# Traverse the array
|
|
for i in range(len(nums)):
|
|
if nums[i] == target: # The target element was found; return its index
|
|
return i
|
|
return -1 # The target element was not found; return -1
|
|
|
|
|
|
def linear_search_linkedlist(head: ListNode, target: int) -> ListNode | None:
|
|
"""Linear search (linked list)"""
|
|
# Traverse the linked list
|
|
while head:
|
|
if head.val == target: # The target node was found; return it
|
|
return head
|
|
head = head.next
|
|
return None # The target node was not found; return None
|
|
|
|
|
|
"""Driver code"""
|
|
if __name__ == "__main__":
|
|
target = 3
|
|
|
|
# Perform linear search on the array
|
|
nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
|
|
index: int = linear_search_array(nums, target)
|
|
print("Index of target element 3 =", index)
|
|
|
|
# Perform linear search on the linked list
|
|
head: ListNode = list_to_linked_list(nums)
|
|
node: ListNode | None = linear_search_linkedlist(head, target)
|
|
print("The node object corresponding to target value 3 is", node)
|