algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 21:24:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update linear_search and hashing_search.

Browse Source
This commit is contained in:
Yudong Jin
2023-02-04 23:49:37 +08:00
parent 62114ce79a
commit f14e3e4c57
22 changed files with 95 additions and 92 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/csharp/chapter_searching/hashing_search.cs
View File

@ -12,7 +12,7 @@ namespace hello_algo.chapter_searching
public class hashing_search
{
/* 哈希查找（数组） */
static int hashingSearch(Dictionary<int, int> map, int target)
static int hashingSearchArray(Dictionary<int, int> map, int target)
{
// 哈希表的 key: 目标元素，value: 索引
// 若哈希表中无此 key ，返回 -1
@ -20,7 +20,7 @@ namespace hello_algo.chapter_searching
}
/* 哈希查找（链表） */
static ListNode? hashingSearch1(Dictionary<int, ListNode> map, int target)
static ListNode? hashingSearchLinkedList(Dictionary<int, ListNode> map, int target)
{
// 哈希表的 key: 目标结点值，value: 结点对象
@ -41,7 +41,7 @@ namespace hello_algo.chapter_searching
{
map[nums[i]] = i; // key: 元素，value: 索引
}
int index = hashingSearch(map, target);
int index = hashingSearchArray(map, target);
Console.WriteLine("目标元素 3 的索引 = " + index);
/* 哈希查找（链表） */
@ -53,7 +53,7 @@ namespace hello_algo.chapter_searching
map1[head.val] = head; // key: 结点值，value: 结点
head = head.next;
}
ListNode? node = hashingSearch1(map1, target);
ListNode? node = hashingSearchLinkedList(map1, target);
Console.WriteLine("目标结点值 3 的对应结点对象为 " + node);
}
}

8
codes/csharp/chapter_searching/linear_search.cs
View File

@ -12,7 +12,7 @@ namespace hello_algo.chapter_searching
public class linear_search
{
/* 线性查找（数组） */
static int linearSearch(int[] nums, int target)
static int linearSearchArray(int[] nums, int target)
{
// 遍历数组
for (int i = 0; i < nums.Length; i++)
@ -26,7 +26,7 @@ namespace hello_algo.chapter_searching
}
/* 线性查找（链表） */
static ListNode? linearSearch(ListNode head, int target)
static ListNode? linearSearchLinkedList(ListNode head, int target)
{
// 遍历链表
while (head != null)
@ -47,12 +47,12 @@ namespace hello_algo.chapter_searching
/* 在数组中执行线性查找 */
int[] nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
int index = linearSearch(nums, target);
int index = linearSearchArray(nums, target);
Console.WriteLine("目标元素 3 的索引 = " + index);
/* 在链表中执行线性查找 */
ListNode head = ListNode.ArrToLinkedList(nums);
ListNode? node = linearSearch(head, target);
ListNode? node = linearSearchLinkedList(head, target);
Console.WriteLine("目标结点值 3 的对应结点对象为 " + node);
}
}