mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-10 16:00:36 +08:00
Retranslate the complete English edition from Simplified Chinese (#2010)
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
This commit is contained in:
@@ -11,40 +11,40 @@ import utils.*;
|
||||
|
||||
public class hash_map {
|
||||
public static void main(String[] args) {
|
||||
/* Initialize hash table */
|
||||
/* Initialize the hash table */
|
||||
Map<Integer, String> map = new HashMap<>();
|
||||
|
||||
/* Add operation */
|
||||
// Add key-value pair (key, value) to the hash table
|
||||
map.put(12836, "Xiao Ha");
|
||||
map.put(15937, "Xiao Luo");
|
||||
map.put(16750, "Xiao Suan");
|
||||
map.put(13276, "Xiao Fa");
|
||||
map.put(10583, "Xiao Ya");
|
||||
System.out.println("\nAfter adding is complete, hash table is\nKey -> Value");
|
||||
/* Insert operation */
|
||||
// Insert the key-value pair (key, value) into the hash table
|
||||
map.put(12836, "小哈");
|
||||
map.put(15937, "小啰");
|
||||
map.put(16750, "小算");
|
||||
map.put(13276, "小法");
|
||||
map.put(10583, "小鸭");
|
||||
System.out.println("\nHash table after insertion:\nKey -> Value");
|
||||
PrintUtil.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.get(15937);
|
||||
System.out.println("\nInput student ID 15937, query name " + name);
|
||||
System.out.println("\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.remove(10583);
|
||||
System.out.println("\nAfter removing 10583, hash table is\nKey -> Value");
|
||||
System.out.println("\nHash table after removing 10583:\nKey -> Value");
|
||||
PrintUtil.printHashMap(map);
|
||||
|
||||
/* Traverse hash table */
|
||||
System.out.println("\nTraverse key-value pairs Key->Value");
|
||||
/* Traverse the hash table */
|
||||
System.out.println("\nTraverse key-value pairs: Key->Value");
|
||||
for (Map.Entry<Integer, String> kv : map.entrySet()) {
|
||||
System.out.println(kv.getKey() + " -> " + kv.getValue());
|
||||
}
|
||||
System.out.println("\nTraverse keys only Key");
|
||||
System.out.println("\nTraverse keys only: Key");
|
||||
for (int key : map.keySet()) {
|
||||
System.out.println(key);
|
||||
}
|
||||
System.out.println("\nTraverse values only Value");
|
||||
System.out.println("\nTraverse values only: Value");
|
||||
for (String val : map.values()) {
|
||||
System.out.println(val);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user