xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-09 05:56:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix(csharp): Modify method name to PascalCase, simplify new expression (#840)

Browse Source 
* Modify method name to PascalCase(array and linked list)

* Modify method name to PascalCase(backtracking)

* Modify method name to PascalCase(computational complexity)

* Modify method name to PascalCase(divide and conquer)

* Modify method name to PascalCase(dynamic programming)

* Modify method name to PascalCase(graph)

* Modify method name to PascalCase(greedy)

* Modify method name to PascalCase(hashing)

* Modify method name to PascalCase(heap)

* Modify method name to PascalCase(searching)

* Modify method name to PascalCase(sorting)

* Modify method name to PascalCase(stack and queue)

* Modify method name to PascalCase(tree)

* local check
This commit is contained in:
hpstory
2023-10-08 01:33:46 +08:00
committed by GitHub
parent 6f7e768cb7
commit f62256bee1
129 changed files with 1186 additions and 1192 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/csharp/chapter_hashing/hash_map_open_addressing.cs
+28 -28
View File
@@ -10,10 +10,10 @@ namespace hello_algo.chapter_hashing;
class HashMapOpenAddressing {
private int size; // 键值对数量
private int capacity = 4; // 哈希表容量
private double loadThres = 2.0 / 3.0; // 触发扩容的负载因子阈值
private int extendRatio = 2; // 扩容倍数
private readonly double loadThres = 2.0 / 3.0; // 触发扩容的负载因子阈值
private readonly int extendRatio = 2; // 扩容倍数
private Pair[] buckets; // 桶数组
private Pair TOMBSTONE = new Pair(-1, "-1"); // 删除标记
private readonly Pair TOMBSTONE = new(-1, "-1"); // 删除标记
/* 构造方法 */
public HashMapOpenAddressing() {
@@ -22,18 +22,18 @@ class HashMapOpenAddressing {
}
/* 哈希函数 */
private int hashFunc(int key) {
private int HashFunc(int key) {
return key % capacity;
}
/* 负载因子 */
private double loadFactor() {
private double LoadFactor() {
return (double)size / capacity;
}
/* 搜索 key 对应的桶索引 */
private int findBucket(int key) {
int index = hashFunc(key);
private int FindBucket(int key) {
int index = HashFunc(key);
int firstTombstone = -1;
// 线性探测，当遇到空桶时跳出
while (buckets[index] != null) {
@@ -59,9 +59,9 @@ class HashMapOpenAddressing {
}
/* 查询操作 */
public string? get(int key) {
public string? Get(int key) {
// 搜索 key 对应的桶索引
int index = findBucket(key);
int index = FindBucket(key);
// 若找到键值对，则返回对应 val
if (buckets[index] != null && buckets[index] != TOMBSTONE) {
return buckets[index].val;
@@ -71,13 +71,13 @@ class HashMapOpenAddressing {
}
/* 添加操作 */
public void put(int key, string val) {
public void Put(int key, string val) {
// 当负载因子超过阈值时，执行扩容
if (loadFactor() > loadThres) {
extend();
if (LoadFactor() > loadThres) {
Extend();
}
// 搜索 key 对应的桶索引
int index = findBucket(key);
int index = FindBucket(key);
// 若找到键值对，则覆盖 val 并返回
if (buckets[index] != null && buckets[index] != TOMBSTONE) {
buckets[index].val = val;
@@ -89,9 +89,9 @@ class HashMapOpenAddressing {
}
/* 删除操作 */
public void remove(int key) {
public void Remove(int key) {
// 搜索 key 对应的桶索引
int index = findBucket(key);
int index = FindBucket(key);
// 若找到键值对，则用删除标记覆盖它
if (buckets[index] != null && buckets[index] != TOMBSTONE) {
buckets[index] = TOMBSTONE;
@@ -100,7 +100,7 @@ class HashMapOpenAddressing {
}
/* 扩容哈希表 */
private void extend() {
private void Extend() {
// 暂存原哈希表
Pair[] bucketsTmp = buckets;
// 初始化扩容后的新哈希表
@@ -110,13 +110,13 @@ class HashMapOpenAddressing {
// 将键值对从原哈希表搬运至新哈希表
foreach (Pair pair in bucketsTmp) {
if (pair != null && pair != TOMBSTONE) {
put(pair.key, pair.val);
Put(pair.key, pair.val);
}
}
}
/* 打印哈希表 */
public void print() {
public void Print() {
foreach (Pair pair in buckets) {
if (pair == null) {
Console.WriteLine("null");
@@ -133,27 +133,27 @@ public class hash_map_open_addressing {
[Test]
public void Test() {
/* 初始化哈希表 */
HashMapOpenAddressing map = new HashMapOpenAddressing();
HashMapOpenAddressing map = new();
/* 添加操作 */
// 在哈希表中添加键值对 (key, value)
map.put(12836, "小哈");
map.put(15937, "小啰");
map.put(16750, "小算");
map.put(13276, "小法");
map.put(10583, "小鸭");
map.Put(12836, "小哈");
map.Put(15937, "小啰");
map.Put(16750, "小算");
map.Put(13276, "小法");
map.Put(10583, "小鸭");
Console.WriteLine("\n添加完成后，哈希表为\nKey -> Value");
map.print();
map.Print();
/* 查询操作 */
// 向哈希表输入键 key ，得到值 value
string name = map.get(13276);
string? name = map.Get(13276);
Console.WriteLine("\n输入学号 13276 ，查询到姓名 " + name);
/* 删除操作 */
// 在哈希表中删除键值对 (key, value)
map.remove(16750);
map.Remove(16750);
Console.WriteLine("\n删除 16750 后，哈希表为\nKey -> Value");
map.print();
map.Print();
}
}