mirror of
https://github.com/krahets/hello-algo.git
synced 2025-12-16 03:59:18 +08:00
Update linear_search and hashing_search.
This commit is contained in:
@@ -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);
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user