hello-algo/codes/javascript/chapter_searching/linear_search.js

48 lines
1.2 KiB
JavaScript
Raw Normal View History

2022-12-22 18:48:18 +08:00
/**
2023-04-23 19:36:07 +08:00
* File: linear_search.js
2022-12-22 18:48:18 +08:00
* Created Time: 2022-12-22
* Author: JoseHung (szhong@link.cuhk.edu.hk)
*/
const { ListNode, arrToLinkedList } = require('../modules/ListNode');
2022-12-22 18:48:18 +08:00
/* 线性查找(数组) */
function linearSearchArray(nums, target) {
// 遍历数组
for (let i = 0; i < nums.length; i++) {
// 找到目标元素,返回其索引
if (nums[i] === target) {
return i;
}
}
// 未找到目标元素,返回 -1
return -1;
2022-12-22 18:48:18 +08:00
}
/* 线性查找(链表)*/
function linearSearchLinkedList(head, target) {
// 遍历链表
while (head) {
// 找到目标节点,返回之
if (head.val === target) {
2022-12-22 18:48:18 +08:00
return head;
}
head = head.next;
}
// 未找到目标节点,返回 null
2022-12-22 18:48:18 +08:00
return null;
}
/* Driver Code */
const target = 3;
2022-12-22 18:48:18 +08:00
/* 在数组中执行线性查找 */
const nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
const index = linearSearchArray(nums, target);
console.log('目标元素 3 的索引 = ' + index);
2022-12-22 18:48:18 +08:00
/* 在链表中执行线性查找 */
const head = arrToLinkedList(nums);
const node = linearSearchLinkedList(head, target);
console.log('目标节点值 3 的对应节点对象为 ', node);