2023-06-26 23:08:55 +08:00
|
|
|
|
/**
|
|
|
|
|
* File: hash_map_open_addressing.cs
|
|
|
|
|
* Created Time: 2023-06-26
|
|
|
|
|
* Author: hpstory (hpstory1024@163.com)
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
namespace hello_algo.chapter_hashing;
|
|
|
|
|
|
|
|
|
|
/* 开放寻址哈希表 */
|
|
|
|
|
class HashMapOpenAddressing {
|
2023-09-24 03:15:23 +08:00
|
|
|
|
private int size; // 键值对数量
|
|
|
|
|
private int capacity = 4; // 哈希表容量
|
2023-09-24 20:38:21 +08:00
|
|
|
|
private double loadThres = 2.0 / 3.0; // 触发扩容的负载因子阈值
|
2023-09-24 03:15:23 +08:00
|
|
|
|
private int extendRatio = 2; // 扩容倍数
|
|
|
|
|
private Pair[] buckets; // 桶数组
|
|
|
|
|
private Pair TOMBSTONE = new Pair(-1, "-1"); // 删除标记
|
2023-06-26 23:08:55 +08:00
|
|
|
|
|
|
|
|
|
/* 构造方法 */
|
|
|
|
|
public HashMapOpenAddressing() {
|
|
|
|
|
size = 0;
|
|
|
|
|
buckets = new Pair[capacity];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 哈希函数 */
|
|
|
|
|
private int hashFunc(int key) {
|
|
|
|
|
return key % capacity;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 负载因子 */
|
|
|
|
|
private double loadFactor() {
|
|
|
|
|
return (double)size / capacity;
|
|
|
|
|
}
|
|
|
|
|
|
2023-09-24 03:15:23 +08:00
|
|
|
|
/* 搜索 key 对应的桶索引 */
|
|
|
|
|
private int findBucket(int key) {
|
2023-06-26 23:08:55 +08:00
|
|
|
|
int index = hashFunc(key);
|
2023-09-24 03:15:23 +08:00
|
|
|
|
int firstTombstone = -1;
|
|
|
|
|
// 线性探测,当遇到空桶时跳出
|
|
|
|
|
while (buckets[index] != null) {
|
|
|
|
|
// 若遇到 key ,返回对应桶索引
|
|
|
|
|
if (buckets[index].key == key) {
|
|
|
|
|
// 若之前遇到了删除标记,则将键值对移动至该索引
|
|
|
|
|
if (firstTombstone != -1) {
|
|
|
|
|
buckets[firstTombstone] = buckets[index];
|
|
|
|
|
buckets[index] = TOMBSTONE;
|
|
|
|
|
return firstTombstone; // 返回移动后的桶索引
|
|
|
|
|
}
|
|
|
|
|
return index; // 返回桶索引
|
|
|
|
|
}
|
|
|
|
|
// 记录遇到的首个删除标记
|
|
|
|
|
if (firstTombstone == -1 && buckets[index] == TOMBSTONE) {
|
|
|
|
|
firstTombstone = index;
|
|
|
|
|
}
|
2023-06-26 23:08:55 +08:00
|
|
|
|
// 计算桶索引,越过尾部返回头部
|
2023-09-24 03:15:23 +08:00
|
|
|
|
index = (index + 1) % capacity;
|
2023-06-26 23:08:55 +08:00
|
|
|
|
}
|
2023-09-24 03:15:23 +08:00
|
|
|
|
// 若 key 不存在,则返回添加点的索引
|
|
|
|
|
return firstTombstone == -1 ? index : firstTombstone;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 查询操作 */
|
2023-10-04 02:30:31 +08:00
|
|
|
|
public string? get(int key) {
|
2023-09-24 03:15:23 +08:00
|
|
|
|
// 搜索 key 对应的桶索引
|
|
|
|
|
int index = findBucket(key);
|
|
|
|
|
// 若找到键值对,则返回对应 val
|
|
|
|
|
if (buckets[index] != null && buckets[index] != TOMBSTONE) {
|
|
|
|
|
return buckets[index].val;
|
|
|
|
|
}
|
|
|
|
|
// 若键值对不存在,则返回 null
|
2023-06-26 23:08:55 +08:00
|
|
|
|
return null;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 添加操作 */
|
|
|
|
|
public void put(int key, string val) {
|
|
|
|
|
// 当负载因子超过阈值时,执行扩容
|
|
|
|
|
if (loadFactor() > loadThres) {
|
|
|
|
|
extend();
|
|
|
|
|
}
|
2023-09-24 03:15:23 +08:00
|
|
|
|
// 搜索 key 对应的桶索引
|
|
|
|
|
int index = findBucket(key);
|
|
|
|
|
// 若找到键值对,则覆盖 val 并返回
|
|
|
|
|
if (buckets[index] != null && buckets[index] != TOMBSTONE) {
|
|
|
|
|
buckets[index].val = val;
|
|
|
|
|
return;
|
2023-06-26 23:08:55 +08:00
|
|
|
|
}
|
2023-09-24 03:15:23 +08:00
|
|
|
|
// 若键值对不存在,则添加该键值对
|
|
|
|
|
buckets[index] = new Pair(key, val);
|
|
|
|
|
size++;
|
2023-06-26 23:08:55 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 删除操作 */
|
|
|
|
|
public void remove(int key) {
|
2023-09-24 03:15:23 +08:00
|
|
|
|
// 搜索 key 对应的桶索引
|
|
|
|
|
int index = findBucket(key);
|
|
|
|
|
// 若找到键值对,则用删除标记覆盖它
|
|
|
|
|
if (buckets[index] != null && buckets[index] != TOMBSTONE) {
|
|
|
|
|
buckets[index] = TOMBSTONE;
|
|
|
|
|
size--;
|
2023-06-26 23:08:55 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 扩容哈希表 */
|
|
|
|
|
private void extend() {
|
|
|
|
|
// 暂存原哈希表
|
|
|
|
|
Pair[] bucketsTmp = buckets;
|
|
|
|
|
// 初始化扩容后的新哈希表
|
|
|
|
|
capacity *= extendRatio;
|
|
|
|
|
buckets = new Pair[capacity];
|
|
|
|
|
size = 0;
|
|
|
|
|
// 将键值对从原哈希表搬运至新哈希表
|
|
|
|
|
foreach (Pair pair in bucketsTmp) {
|
2023-09-24 03:15:23 +08:00
|
|
|
|
if (pair != null && pair != TOMBSTONE) {
|
2023-06-26 23:08:55 +08:00
|
|
|
|
put(pair.key, pair.val);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 打印哈希表 */
|
|
|
|
|
public void print() {
|
|
|
|
|
foreach (Pair pair in buckets) {
|
2023-09-24 03:15:23 +08:00
|
|
|
|
if (pair == null) {
|
2023-06-26 23:08:55 +08:00
|
|
|
|
Console.WriteLine("null");
|
2023-09-24 03:15:23 +08:00
|
|
|
|
} else if (pair == TOMBSTONE) {
|
|
|
|
|
Console.WriteLine("TOMBSTONE");
|
|
|
|
|
} else {
|
|
|
|
|
Console.WriteLine(pair.key + " -> " + pair.val);
|
2023-06-26 23:08:55 +08:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public class hash_map_open_addressing {
|
|
|
|
|
[Test]
|
|
|
|
|
public void Test() {
|
|
|
|
|
/* 初始化哈希表 */
|
|
|
|
|
HashMapOpenAddressing map = new HashMapOpenAddressing();
|
|
|
|
|
|
|
|
|
|
/* 添加操作 */
|
|
|
|
|
// 在哈希表中添加键值对 (key, value)
|
|
|
|
|
map.put(12836, "小哈");
|
|
|
|
|
map.put(15937, "小啰");
|
|
|
|
|
map.put(16750, "小算");
|
|
|
|
|
map.put(13276, "小法");
|
|
|
|
|
map.put(10583, "小鸭");
|
|
|
|
|
Console.WriteLine("\n添加完成后,哈希表为\nKey -> Value");
|
|
|
|
|
map.print();
|
|
|
|
|
|
|
|
|
|
/* 查询操作 */
|
|
|
|
|
// 向哈希表输入键 key ,得到值 value
|
|
|
|
|
string name = map.get(13276);
|
|
|
|
|
Console.WriteLine("\n输入学号 13276 ,查询到姓名 " + name);
|
|
|
|
|
|
|
|
|
|
/* 删除操作 */
|
|
|
|
|
// 在哈希表中删除键值对 (key, value)
|
|
|
|
|
map.remove(16750);
|
|
|
|
|
Console.WriteLine("\n删除 16750 后,哈希表为\nKey -> Value");
|
|
|
|
|
map.print();
|
|
|
|
|
}
|
|
|
|
|
}
|