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

36
en/codes/cpp/chapter_hashing/hash_map.cpp
View File

@@ -6,38 +6,38 @@
#include "../utils/common.hpp"
/* Driver Code */
/* Driver code */
int main() {
/* Initialize hash table */
/* Initialize the hash table */
unordered_map<int, string> map;
/* Add operation */
// Add key-value pair (key, value) to the hash table
map[12836] = "Xiao Ha";
map[15937] = "Xiao Luo";
map[16750] = "Xiao Suan";
map[13276] = "Xiao Fa";
map[10583] = "Xiao Ya";
cout << "\nAfter adding is complete, hash table is\nKey -> Value" << endl;
/* Insert operation */
// Insert the key-value pair (key, value) into the hash table
map[12836] = "小哈";
map[15937] = "小啰";
map[16750] = "小算";
map[13276] = "小法";
map[10583] = "小鸭";
cout << "\nHash table after insertion:\nKey -> Value" << endl;
printHashMap(map);
/* Query operation */
// Input key into hash table to get value
/* Lookup operation */
// Look up key in the hash table to obtain value
string name = map[15937];
cout << "\nInput student ID 15937, query name " << name << endl;
cout << "\nLook up student ID 15937 to obtain the name " << name << endl;
/* Remove operation */
// Remove key-value pair (key, value) from hash table
// Remove the key-value pair (key, value) from the hash table
map.erase(10583);
cout << "\nAfter removing 10583, hash table is\nKey -> Value" << endl;
cout << "\nHash table after removing 10583:\nKey -> Value" << endl;
printHashMap(map);
/* Traverse hash table */
cout << "\nTraverse key-value pairs Key->Value" << endl;
/* Traverse the hash table */
cout << "\nTraverse key-value pairs: Key->Value" << endl;
for (auto kv : map) {
cout << kv.first << " -> " << kv.second << endl;
}
cout << "\nTraverse Key->Value using iterator" << endl;
cout << "\nTraverse Key->Value pairs using an iterator" << endl;
for (auto iter = map.begin(); iter != map.end(); iter++) {
cout << iter->first << "->" << iter->second << endl;
}