hello-algo/codes/javascript/chapter_searching/hashing_search.js

46 lines
1.3 KiB
JavaScript
Raw Normal View History

2023-01-08 20:35:17 +08:00
/**
2022-12-29 03:20:37 +08:00
* File: hashing_search.js
* Created Time: 2022-12-29
2023-01-08 20:39:42 +08:00
* Author: Zhuo Qinyue (1403450829@qq.com)
2022-12-29 03:20:37 +08:00
*/
const { arrToLinkedList } = require("../modules/ListNode");
2022-12-29 03:20:37 +08:00
/* 哈希查找(数组) */
function hashingSearchArray(map, target) {
2023-01-08 20:30:55 +08:00
// 哈希表的 key: 目标元素value: 索引
// 若哈希表中无此 key ,返回 -1
return map.has(target) ? map.get(target) : -1;
2022-12-29 03:20:37 +08:00
}
/* 哈希查找(链表) */
function hashingSearchLinkedList(map, target) {
// 哈希表的 key: 目标节点值value: 节点对象
2023-01-08 20:30:55 +08:00
// 若哈希表中无此 key ,返回 null
return map.has(target) ? map.get(target) : null;
2022-12-29 03:20:37 +08:00
}
/* Driver Code */
const target = 3;
2023-01-08 20:30:55 +08:00
/* 哈希查找(数组) */
const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
// 初始化哈希表
const map = new Map();
for (let i = 0; i < nums.length; i++) {
map.set(nums[i], i); // key: 元素value: 索引
2022-12-29 03:20:37 +08:00
}
const index = hashingSearchArray(map, target);
console.log("目标元素 3 的索引 = " + index);
2022-12-29 03:20:37 +08:00
/* 哈希查找(链表) */
let head = arrToLinkedList(nums)
// 初始化哈希表
const map1 = new Map();
while (head != null) {
map1.set(head.val, head); // key: 节点值value: 节点
head = head.next;
}
const node = hashingSearchLinkedList(map1, target);
console.log("目标节点值 3 的对应节点对象为", node);