Files
hpstory 56b20eff36 feat(csharp) .NET 8.0 code migration (#966)
* .net 8.0 migration

* update docs

* revert change

* revert change and update appendix docs

* remove static

* Update binary_search_insertion.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-11-26 23:18:44 +08:00

51 lines
1.6 KiB
C#

/**
* File: hashing_search.cs
* Created Time: 2022-12-23
* Author: haptear (haptear@hotmail.com)
*/
namespace hello_algo.chapter_searching;
public class hashing_search {
/* 哈希查找(数组) */
int HashingSearchArray(Dictionary<int, int> map, int target) {
// 哈希表的 key: 目标元素,value: 索引
// 若哈希表中无此 key ,返回 -1
return map.GetValueOrDefault(target, -1);
}
/* 哈希查找(链表) */
ListNode? HashingSearchLinkedList(Dictionary<int, ListNode> map, int target) {
// 哈希表的 key: 目标节点值,value: 节点对象
// 若哈希表中无此 key ,返回 null
return map.GetValueOrDefault(target);
}
[Test]
public void Test() {
int target = 3;
/* 哈希查找(数组) */
int[] nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
// 初始化哈希表
Dictionary<int, int> map = [];
for (int i = 0; i < nums.Length; i++) {
map[nums[i]] = i; // key: 元素,value: 索引
}
int index = HashingSearchArray(map, target);
Console.WriteLine("目标元素 3 的索引 = " + index);
/* 哈希查找(链表) */
ListNode? head = ListNode.ArrToLinkedList(nums);
// 初始化哈希表
Dictionary<int, ListNode> map1 = [];
while (head != null) {
map1[head.val] = head; // key: 节点值,value: 节点
head = head.next;
}
ListNode? node = HashingSearchLinkedList(map1, target);
Console.WriteLine("目标节点值 3 的对应节点对象为 " + node);
}
}