From 01b95bc0f9e34ae6f41c95f380a3ab3ab8d42d7a Mon Sep 17 00:00:00 2001
From: steak-zhuo <zhuoqinyue@gmail.com>
Date: Thu, 29 Dec 2022 03:20:37 +0800
Subject: [PATCH] =?UTF-8?q?=E8=A1=A5=E5=85=85js=E5=92=8Cts=E5=AF=B9?=
 =?UTF-8?q?=E5=BA=94=E7=9A=84=E5=93=88=E5=B8=8C=E6=9F=A5=E6=89=BE?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../chapter_searching/hashing_search.js       | 51 +++++++++++++++++++
 .../chapter_searching/hashing_search.ts       | 47 +++++++++++++++++
 2 files changed, 98 insertions(+)
 create mode 100644 codes/javascript/chapter_searching/hashing_search.js
 create mode 100644 codes/typescript/chapter_searching/hashing_search.ts

diff --git a/codes/javascript/chapter_searching/hashing_search.js b/codes/javascript/chapter_searching/hashing_search.js
new file mode 100644
index 00000000..c1e39766
--- /dev/null
+++ b/codes/javascript/chapter_searching/hashing_search.js
@@ -0,0 +1,51 @@
+/*
+ * File: hashing_search.js
+ * Created Time: 2022-12-29
+ * Author: zhuoqinyue (1403450829@qq.com)
+ */
+
+const PrintUtil = require("../include/PrintUtil");
+const ListNode = require("../include/ListNode");
+
+
+/* 哈希查找（数组） */
+function hashingSearch(map, target) {
+  // 哈希表的 key: 目标元素，value: 索引
+  // 若哈希表中无此 key ，返回 -1
+  return map.has(target) ? map.get(target) : -1;
+}
+
+/* 哈希查找（链表） */
+function hashingSearch1(map, target) {
+  // 哈希表的 key: 目标结点值，value: 结点对象
+  // 若哈希表中无此 key ，返回 null
+  return map.has(target) ? map.get(target) : null;
+}
+
+function main() {
+  const target = 3;
+
+  /* 哈希查找（数组） */
+  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: 索引
+  }
+  const index = hashingSearch(map, target);
+  console.log("目标元素 3 的索引 = " + index);
+
+  /* 哈希查找（链表） */
+  let head = new ListNode().arrToLinkedList(nums)
+  // 初始化哈希表
+  const map1 = new Map();
+  while (head != null) {
+    map1.set(head.val, head);  // key: 结点值，value: 结点
+    head = head.next;
+  }
+  const node = hashingSearch1(map1, target);
+  console.log("目标结点值 3 的对应结点对象为" );
+  PrintUtil.printLinkedList(node);
+}
+
+main();
diff --git a/codes/typescript/chapter_searching/hashing_search.ts b/codes/typescript/chapter_searching/hashing_search.ts
new file mode 100644
index 00000000..0d89ee9c
--- /dev/null
+++ b/codes/typescript/chapter_searching/hashing_search.ts
@@ -0,0 +1,47 @@
+/*
+ * File: hashing_search.js
+ * Created Time: 2022-12-29
+ * Author: zhuoqinyue (1403450829@qq.com)
+ */
+
+/* 哈希查找（数组） */
+function hashingSearch(map: Map<number, number>, target: number) {
+  // 哈希表的 key: 目标元素，value: 索引
+  // 若哈希表中无此 key ，返回 -1
+  return map.has(target) ? map.get(target) : -1;
+}
+
+/* 哈希查找（链表） */
+function hashingSearch1(map: Map<number, any>, target: number) {
+  // 哈希表的 key: 目标结点值，value: 结点对象
+  // 若哈希表中无此 key ，返回 null
+  return map.has(target) ? map.get(target) : null;
+}
+
+function main() {
+  const target = 3;
+
+  /* 哈希查找（数组） */
+  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: 索引
+  }
+  const index = hashingSearch(map, target);
+  console.log("目标元素 3 的索引 = " + index);
+
+//   /* 哈希查找（链表） */
+//   let head = new ListNode().arrToLinkedList(nums)
+//   // 初始化哈希表
+//   const map1 = new Map();
+//   while (head != null) {
+//     map1.set(head.val, head);  // key: 结点值，value: 结点
+//     head = head.next;
+//   }
+//   const node = hashingSearch1(map1, target);
+//   console.log("目标结点值 3 的对应结点对象为" );
+//   printLinkedList(node);
+}
+
+main();