algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +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/java/chapter_searching/hashing_search.java
View File

@ -11,14 +11,14 @@ import java.util.*;
public class hashing_search {
/* 哈希查找（数组） */
static int hashingSearch(Map<Integer, Integer> map, int target) {
static int hashingSearchArray(Map<Integer, Integer> map, int target) {
// 哈希表的 key: 目标元素，value: 索引
// 若哈希表中无此 key ，返回 -1
return map.getOrDefault(target, -1);
}
/* 哈希查找（链表） */
static ListNode hashingSearch1(Map<Integer, ListNode> map, int target) {
static ListNode hashingSearchLinkedList(Map<Integer, ListNode> map, int target) {
// 哈希表的 key: 目标结点值，value: 结点对象
// 若哈希表中无此 key ，返回 null
return map.getOrDefault(target, null);
@ -34,7 +34,7 @@ public class hashing_search {
for (int i = 0; i < nums.length; i++) {
map.put(nums[i], i); // key: 元素，value: 索引
}
int index = hashingSearch(map, target);
int index = hashingSearchArray(map, target);
System.out.println("目标元素 3 的索引 = " + index);
/* 哈希查找（链表） */
@ -45,7 +45,7 @@ public class hashing_search {
map1.put(head.val, head); // key: 结点值，value: 结点
head = head.next;
}
ListNode node = hashingSearch1(map1, target);
ListNode node = hashingSearchLinkedList(map1, target);
System.out.println("目标结点值 3 的对应结点对象为 " + node);
}
}

8
codes/java/chapter_searching/linear_search.java
View File

@ -10,7 +10,7 @@ import include.*;
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++) {
// 找到目标元素，返回其索引
@ -22,7 +22,7 @@ public class linear_search {
}
/* 线性查找（链表） */
static ListNode linearSearch(ListNode head, int target) {
static ListNode linearSearchLinkedList(ListNode head, int target) {
// 遍历链表
while (head != null) {
// 找到目标结点，返回之
@ -39,12 +39,12 @@ public class linear_search {
/* 在数组中执行线性查找 */
int[] nums = { 1, 5, 3, 2, 4, 7, 5, 9, 10, 8 };
int index = linearSearch(nums, target);
int index = linearSearchArray(nums, target);
System.out.println("目标元素 3 的索引 = " + index);
/* 在链表中执行线性查找 */
ListNode head = ListNode.arrToLinkedList(nums);
ListNode node = linearSearch(head, target);
ListNode node = linearSearchLinkedList(head, target);
System.out.println("目标结点值 3 的对应结点对象为 " + node);
}
}