xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-11 11:20:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat(csharp) .NET 8.0 code migration (#966)

Browse Source 
* .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>
This commit is contained in:
hpstory
2023-11-26 23:18:44 +08:00
committed by GitHub
parent d960c99a1f
commit 56b20eff36
93 changed files with 539 additions and 487 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/csharp/chapter_searching/hashing_search.cs
+5 -5
View File
@@ -8,14 +8,14 @@ namespace hello_algo.chapter_searching;
public class hashing_search {
/* 哈希查找（数组） */
static int HashingSearchArray(Dictionary<int, int> map, int target) {
int HashingSearchArray(Dictionary<int, int> map, int target) {
// 哈希表的 key: 目标元素，value: 索引
// 若哈希表中无此 key ，返回 -1
return map.GetValueOrDefault(target, -1);
}
/* 哈希查找（链表） */
static ListNode? HashingSearchLinkedList(Dictionary<int, ListNode> map, int target) {
ListNode? HashingSearchLinkedList(Dictionary<int, ListNode> map, int target) {
// 哈希表的 key: 目标节点值，value: 节点对象
// 若哈希表中无此 key ，返回 null
@@ -27,9 +27,9 @@ public class hashing_search {
int target = 3;
/* 哈希查找（数组） */
int[] nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
int[] nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
// 初始化哈希表
Dictionary<int, int> map = new();
Dictionary<int, int> map = [];
for (int i = 0; i < nums.Length; i++) {
map[nums[i]] = i; // key: 元素，value: 索引
}
@@ -39,7 +39,7 @@ public class hashing_search {
/* 哈希查找（链表） */
ListNode? head = ListNode.ArrToLinkedList(nums);
// 初始化哈希表
Dictionary<int, ListNode> map1 = new();
Dictionary<int, ListNode> map1 = [];
while (head != null) {
map1[head.val] = head; // key: 节点值，value: 节点
head = head.next;