CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-11-10 16:00:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

Retranslate the complete English edition from Simplified Chinese (#2010)

Browse Source 
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
This commit is contained in:
Yudong Jin
2026-10-31 03:35:51 +08:00
committed by GitHub
parent ef46e2ed95
commit 14c314c08c
1502 changed files with 29459 additions and 23517 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
en/codes/javascript/chapter_hashing/array_hash_map.js
View File

@@ -4,7 +4,7 @@
* Author: Justin (xiefahit@gmail.com)
*/
/* Key-value pair Number -> String */
/* Key-value pair: Number -> String */
class Pair {
constructor(key, val) {
this.key = key;
@@ -12,11 +12,11 @@ class Pair {
}
}
/* Hash table based on array implementation */
/* Hash table implemented with an array */
class ArrayHashMap {
#buckets;
constructor() {
// Initialize array with 100 buckets
// Initialize an array containing 100 buckets
this.#buckets = new Array(100).fill(null);
}
@@ -25,7 +25,7 @@ class ArrayHashMap {
return key % 100;
}
/* Query operation */
/* Lookup operation */
get(key) {
let index = this.#hashFunc(key);
let pair = this.#buckets[index];
@@ -33,7 +33,7 @@ class ArrayHashMap {
return pair.val;
}
/* Add operation */
/* Insert operation */
set(key, val) {
let index = this.#hashFunc(key);
this.#buckets[index] = new Pair(key, val);
@@ -42,7 +42,7 @@ class ArrayHashMap {
/* Remove operation */
delete(key) {
let index = this.#hashFunc(key);
// Set to null to represent deletion
// Set the bucket to null to mark it as deleted
this.#buckets[index] = null;
}
@@ -79,7 +79,7 @@ class ArrayHashMap {
return arr;
}
/* Print hash table */
/* Print the hash table */
print() {
let pairSet = this.entries();
for (const pair of pairSet) {
@@ -88,41 +88,41 @@ class ArrayHashMap {
}
}
/* Driver Code */
/* Initialize hash table */
/* Driver code */
/* Initialize the hash table */
const map = new ArrayHashMap();
/* Add operation */
// Add key-value pair (key, value) to the hash table
map.set(12836, 'Xiao Ha');
map.set(15937, 'Xiao Luo');
map.set(16750, 'Xiao Suan');
map.set(13276, 'Xiao Fa');
map.set(10583, 'Xiao Ya');
console.info('\nAfter adding is complete, hash table is\nKey -> Value');
/* Insert operation */
// Insert the key-value pair (key, value) into the hash table
map.set(12836, '小哈');
map.set(15937, '小啰');
map.set(16750, '小算');
map.set(13276, '小法');
map.set(10583, '小鸭');
console.info('\nHash table after insertion:\nKey -> Value');
map.print();
/* Query operation */
// Input key into hash table to get value
/* Lookup operation */
// Look up key in the hash table to obtain value
let name = map.get(15937);
console.info('\nInput student ID 15937, query name ' + name);
console.info('\nLook up student ID 15937 to obtain the name ' + name);
/* Remove operation */
// Remove key-value pair (key, value) from hash table
// Remove the key-value pair (key, value) from the hash table
map.delete(10583);
console.info('\nAfter removing 10583, hash table is\nKey -> Value');
console.info('\nHash table after removing 10583:\nKey -> Value');
map.print();
/* Traverse hash table */
console.info('\nTraverse key-value pairs Key->Value');
/* Traverse the hash table */
console.info('\nTraverse key-value pairs: Key->Value');
for (const pair of map.entries()) {
if (!pair) continue;
console.info(pair.key + ' -> ' + pair.val);
}
console.info('\nTraverse keys only Key');
console.info('\nTraverse keys only: Key');
for (const key of map.keys()) {
console.info(key);
}
console.info('\nTraverse values only Value');
console.info('\nTraverse values only: Value');
for (const val of map.values()) {
console.info(val);
}