hello-algo/codes/java/chapter_hashing/array_hash_map.java

142 lines
3.6 KiB
Java
Raw Normal View History

/**
2023-04-23 19:36:07 +08:00
* File: array_hash_map.java
2022-12-05 02:37:16 +08:00
* Created Time: 2022-12-04
* Author: Krahets (krahets@163.com)
*/
package chapter_hashing;
2023-01-12 04:08:45 +08:00
2022-12-05 02:37:16 +08:00
import java.util.*;
/* 键值对 int->String */
class Entry {
public int key;
public String val;
2022-12-05 02:37:16 +08:00
public Entry(int key, String val) {
this.key = key;
this.val = val;
}
}
/* 基于数组简易实现的哈希表 */
class ArrayHashMap {
2023-03-15 03:11:43 +08:00
private List<Entry> buckets;
2022-12-05 02:37:16 +08:00
public ArrayHashMap() {
2023-03-15 03:48:31 +08:00
// 初始化数组,包含 100 个桶
2023-03-15 03:11:43 +08:00
buckets = new ArrayList<>();
2022-12-06 01:00:21 +08:00
for (int i = 0; i < 100; i++) {
2023-03-15 03:11:43 +08:00
buckets.add(null);
2022-12-05 02:37:16 +08:00
}
}
/* 哈希函数 */
private int hashFunc(int key) {
2022-12-06 01:00:21 +08:00
int index = key % 100;
2022-12-05 02:37:16 +08:00
return index;
}
/* 查询操作 */
public String get(int key) {
int index = hashFunc(key);
2023-03-15 03:11:43 +08:00
Entry pair = buckets.get(index);
if (pair == null)
return null;
2022-12-05 02:37:16 +08:00
return pair.val;
}
/* 添加操作 */
public void put(int key, String val) {
Entry pair = new Entry(key, val);
int index = hashFunc(key);
2023-03-15 03:11:43 +08:00
buckets.set(index, pair);
2022-12-05 02:37:16 +08:00
}
/* 删除操作 */
public void remove(int key) {
int index = hashFunc(key);
2022-12-15 22:53:22 +08:00
// 置为 null ,代表删除
2023-03-15 03:11:43 +08:00
buckets.set(index, null);
2022-12-05 02:37:16 +08:00
}
/* 获取所有键值对 */
public List<Entry> entrySet() {
List<Entry> entrySet = new ArrayList<>();
2023-03-15 03:11:43 +08:00
for (Entry pair : buckets) {
2022-12-05 02:37:16 +08:00
if (pair != null)
entrySet.add(pair);
}
return entrySet;
}
/* 获取所有键 */
public List<Integer> keySet() {
List<Integer> keySet = new ArrayList<>();
2023-03-15 03:11:43 +08:00
for (Entry pair : buckets) {
2022-12-05 02:37:16 +08:00
if (pair != null)
keySet.add(pair.key);
}
return keySet;
}
/* 获取所有值 */
public List<String> valueSet() {
List<String> valueSet = new ArrayList<>();
2023-03-15 03:11:43 +08:00
for (Entry pair : buckets) {
2022-12-05 02:37:16 +08:00
if (pair != null)
valueSet.add(pair.val);
}
return valueSet;
}
/* 打印哈希表 */
public void print() {
for (Entry kv : entrySet()) {
2022-12-05 02:37:16 +08:00
System.out.println(kv.key + " -> " + kv.val);
}
}
}
public class array_hash_map {
public static void main(String[] args) {
/* 初始化哈希表 */
ArrayHashMap map = new ArrayHashMap();
/* 添加操作 */
// 在哈希表中添加键值对 (key, value)
map.put(12836, "小哈");
map.put(15937, "小啰");
map.put(16750, "小算");
2022-12-06 01:00:21 +08:00
map.put(13276, "小法");
map.put(10583, "小鸭");
2022-12-05 02:37:16 +08:00
System.out.println("\n添加完成后哈希表为\nKey -> Value");
map.print();
/* 查询操作 */
// 向哈希表输入键 key ,得到值 value
2022-12-06 01:00:21 +08:00
String name = map.get(15937);
System.out.println("\n输入学号 15937 ,查询到姓名 " + name);
2022-12-05 02:37:16 +08:00
/* 删除操作 */
// 在哈希表中删除键值对 (key, value)
2022-12-06 01:00:21 +08:00
map.remove(10583);
System.out.println("\n删除 10583 后,哈希表为\nKey -> Value");
2022-12-05 02:37:16 +08:00
map.print();
/* 遍历哈希表 */
System.out.println("\n遍历键值对 Key->Value");
for (Entry kv : map.entrySet()) {
2022-12-05 02:37:16 +08:00
System.out.println(kv.key + " -> " + kv.val);
}
System.out.println("\n单独遍历键 Key");
for (int key : map.keySet()) {
2022-12-05 02:37:16 +08:00
System.out.println(key);
}
System.out.println("\n单独遍历值 Value");
for (String val : map.valueSet()) {
2022-12-05 02:37:16 +08:00
System.out.println(val);
}
}
}