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

51 lines
1.4 KiB
Python
Raw Normal View History

"""
File: hashing_search.py
2022-12-03 22:53:53 +08:00
Created Time: 2022-11-26
Author: timi (xisunyy@163.com)
"""
import sys, os.path as osp
2023-04-09 05:05:35 +08:00
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
2023-03-03 03:07:22 +08:00
from modules import *
2023-04-09 05:05:35 +08:00
def hashing_search_array(mapp: dict[int, int], target: int) -> int:
2023-04-09 05:05:35 +08:00
"""哈希查找(数组)"""
2022-12-03 22:53:53 +08:00
# 哈希表的 key: 目标元素value: 索引
# 若哈希表中无此 key ,返回 -1
return mapp.get(target, -1)
2022-12-03 22:53:53 +08:00
2023-04-09 05:05:35 +08:00
def hashing_search_linkedlist(
mapp: dict[int, ListNode], target: int
) -> ListNode | None:
"""哈希查找(链表)"""
# 哈希表的 key: 目标元素value: 节点对象
# 若哈希表中无此 key ,返回 None
return mapp.get(target, None)
2022-12-03 22:53:53 +08:00
"""Driver Code"""
2023-04-09 05:05:35 +08:00
if __name__ == "__main__":
target = 3
2023-04-09 05:05:35 +08:00
2022-12-03 22:53:53 +08:00
# 哈希查找(数组)
nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8]
# 初始化哈希表
map0 = dict[int, int]()
2022-12-03 22:53:53 +08:00
for i in range(len(nums)):
map0[nums[i]] = i # key: 元素value: 索引
index: int = hashing_search_array(map0, target)
print("目标元素 3 的索引 =", index)
2022-12-03 22:53:53 +08:00
# 哈希查找(链表)
head: ListNode = list_to_linked_list(nums)
# 初始化哈希表
map1 = dict[int, ListNode]()
2022-12-03 22:53:53 +08:00
while head:
map1[head.val] = head # key: 节点值value: 节点
head = head.next
node: ListNode = hashing_search_linkedlist(map1, target)
print("目标节点值 3 的对应节点对象为", node)