mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 12:56:29 +08:00
commit
8f66b02d2b
4 changed files with 131 additions and 9 deletions
51
codes/javascript/chapter_searching/hashing_search.js
Normal file
51
codes/javascript/chapter_searching/hashing_search.js
Normal file
|
@ -0,0 +1,51 @@
|
|||
/**
|
||||
* File: hashing_search.js
|
||||
* Created Time: 2022-12-29
|
||||
* Author: Zhuo Qinyue (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();
|
51
codes/typescript/chapter_searching/hashing_search.ts
Normal file
51
codes/typescript/chapter_searching/hashing_search.ts
Normal file
|
@ -0,0 +1,51 @@
|
|||
/**
|
||||
* File: hashing_search.js
|
||||
* Created Time: 2022-12-29
|
||||
* Author: Zhuo Qinyue (1403450829@qq.com)
|
||||
*/
|
||||
|
||||
import { printLinkedList } from "../module/PrintUtil";
|
||||
import ListNode from "../module/ListNode";
|
||||
|
||||
|
||||
/* 哈希查找(数组) */
|
||||
function hashingSearch(map: Map<number, number>, target: number): number {
|
||||
// 哈希表的 key: 目标元素,value: 索引
|
||||
// 若哈希表中无此 key ,返回 -1
|
||||
return map.has(target) ? map.get(target) as number : -1;
|
||||
}
|
||||
|
||||
/* 哈希查找(链表) */
|
||||
function hashingSearch1(map: Map<number, ListNode>, target: number): ListNode | null {
|
||||
// 哈希表的 key: 目标结点值,value: 结点对象
|
||||
// 若哈希表中无此 key ,返回 null
|
||||
return map.has(target) ? map.get(target) as ListNode : 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();
|
|
@ -16,12 +16,12 @@ export default class ListNode {
|
|||
}
|
||||
|
||||
/**
|
||||
* Generate a linked-list with an array
|
||||
* Generate a linked list with an array
|
||||
* @param arr
|
||||
* @return ListNode
|
||||
* @return
|
||||
*/
|
||||
public static arrToLinkedList(arr: number[]): ListNode | null {
|
||||
const dum = new ListNode(0);
|
||||
arrToLinkedList(arr: number[]): ListNode | null {
|
||||
const dum: ListNode = new ListNode(0);
|
||||
let head = dum;
|
||||
for (const val of arr) {
|
||||
head.next = new ListNode(val);
|
||||
|
|
|
@ -68,13 +68,23 @@ comments: true
|
|||
=== "JavaScript"
|
||||
|
||||
```js title="hashing_search.js"
|
||||
|
||||
/* 哈希查找(数组) */
|
||||
function hashingSearch(map, target) {
|
||||
// 哈希表的 key: 目标元素,value: 索引
|
||||
// 若哈希表中无此 key ,返回 -1
|
||||
return map.has(target) ? map.get(target) : -1;
|
||||
}
|
||||
```
|
||||
|
||||
=== "TypeScript"
|
||||
|
||||
```typescript title="hashing_search.ts"
|
||||
|
||||
/* 哈希查找(数组) */
|
||||
function hashingSearch(map: Map<number, number>, target: number): number {
|
||||
// 哈希表的 key: 目标元素,value: 索引
|
||||
// 若哈希表中无此 key ,返回 -1
|
||||
return map.has(target) ? map.get(target) as number : -1;
|
||||
}
|
||||
```
|
||||
|
||||
=== "C"
|
||||
|
@ -151,19 +161,29 @@ comments: true
|
|||
} else {
|
||||
return nil
|
||||
}
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
=== "JavaScript"
|
||||
|
||||
```js title="hashing_search.js"
|
||||
|
||||
/* 哈希查找(链表) */
|
||||
function hashingSearch1(map, target) {
|
||||
// 哈希表的 key: 目标结点值,value: 结点对象
|
||||
// 若哈希表中无此 key ,返回 null
|
||||
return map.has(target) ? map.get(target) : null;
|
||||
}
|
||||
```
|
||||
|
||||
=== "TypeScript"
|
||||
|
||||
```typescript title="hashing_search.ts"
|
||||
|
||||
/* 哈希查找(链表) */
|
||||
function hashingSearch1(map: Map<number, ListNode>, target: number): ListNode | null {
|
||||
// 哈希表的 key: 目标结点值,value: 结点对象
|
||||
// 若哈希表中无此 key ,返回 null
|
||||
return map.has(target) ? map.get(target) as ListNode : null;
|
||||
}
|
||||
```
|
||||
|
||||
=== "C"
|
||||
|
|
Loading…
Reference in a new issue