mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-11-04 06:07:20 +08:00 
			
		
		
		
	add linear_search in JS
This commit is contained in:
		
							
								
								
									
										48
									
								
								codes/javascript/chapter_searching/linear_search.js
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										48
									
								
								codes/javascript/chapter_searching/linear_search.js
									
									
									
									
									
										Normal file
									
								
							@ -0,0 +1,48 @@
 | 
			
		||||
/**
 | 
			
		||||
 * File: linear-search.js
 | 
			
		||||
 * Created Time: 2022-12-22
 | 
			
		||||
 * Author: JoseHung (szhong@link.cuhk.edu.hk)
 | 
			
		||||
 */
 | 
			
		||||
 | 
			
		||||
const ListNode = require("../include/ListNode");
 | 
			
		||||
 | 
			
		||||
/* 线性查找(数组) */
 | 
			
		||||
function linearSearchArray(nums, target) {
 | 
			
		||||
    // 遍历数组
 | 
			
		||||
    for (let i = 0; i < nums.length; i++) {
 | 
			
		||||
        // 找到目标元素,返回其索引
 | 
			
		||||
        if (nums[i] === target) {
 | 
			
		||||
            return i;
 | 
			
		||||
        }
 | 
			
		||||
    }
 | 
			
		||||
    // 未找到目标元素,返回 -1
 | 
			
		||||
    return -1; 
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
/* 线性查找(链表)*/
 | 
			
		||||
function linearSearchLinkedList(head, target) {
 | 
			
		||||
    // 遍历链表
 | 
			
		||||
    while(head) {
 | 
			
		||||
        // 找到目标结点,返回之
 | 
			
		||||
        if(head.val === target) {
 | 
			
		||||
            return head;
 | 
			
		||||
        }
 | 
			
		||||
        head = head.next;
 | 
			
		||||
    }
 | 
			
		||||
    // 未找到目标结点,返回 null
 | 
			
		||||
    return null;
 | 
			
		||||
}
 | 
			
		||||
 | 
			
		||||
/* Driver Code */
 | 
			
		||||
var target = 3;
 | 
			
		||||
 | 
			
		||||
/* 在数组中执行线性查找 */
 | 
			
		||||
var nums = [1, 5, 3, 2, 4, 7, 5, 9, 10, 8];
 | 
			
		||||
var index = linearSearchArray(nums, target);
 | 
			
		||||
console.log("目标元素 3 的索引 = " + index);
 | 
			
		||||
 | 
			
		||||
/* 在链表中执行线性查找 */
 | 
			
		||||
var linkedList = new ListNode();
 | 
			
		||||
var head = linkedList.arrToLinkedList(nums);
 | 
			
		||||
var node = linearSearchLinkedList(head, target);
 | 
			
		||||
console.log("目标结点值 3 的对应结点对象为 " + node);
 | 
			
		||||
@ -76,6 +76,18 @@ comments: true
 | 
			
		||||
=== "JavaScript"
 | 
			
		||||
 | 
			
		||||
    ```js title="linear_search.js"
 | 
			
		||||
    /* 线性查找(数组) */
 | 
			
		||||
    function linearSearchArray(nums, target) {
 | 
			
		||||
        // 遍历数组
 | 
			
		||||
        for (let i = 0; i < nums.length; i++) {
 | 
			
		||||
            // 找到目标元素,返回其索引
 | 
			
		||||
            if (nums[i] === target) {
 | 
			
		||||
                return i;
 | 
			
		||||
            }
 | 
			
		||||
        }
 | 
			
		||||
        // 未找到目标元素,返回 -1
 | 
			
		||||
        return -1; 
 | 
			
		||||
    }
 | 
			
		||||
 | 
			
		||||
    ```
 | 
			
		||||
 | 
			
		||||
@ -167,7 +179,19 @@ comments: true
 | 
			
		||||
=== "JavaScript"
 | 
			
		||||
 | 
			
		||||
    ```js title="linear_search.js"
 | 
			
		||||
 | 
			
		||||
    /* 线性查找(链表)*/
 | 
			
		||||
    function linearSearchLinkedList(head, target) {
 | 
			
		||||
        // 遍历链表
 | 
			
		||||
        while(head) {
 | 
			
		||||
            // 找到目标结点,返回之
 | 
			
		||||
            if(head.val === target) {
 | 
			
		||||
                return head;
 | 
			
		||||
            }
 | 
			
		||||
            head = head.next;
 | 
			
		||||
        }
 | 
			
		||||
        // 未找到目标结点,返回 null
 | 
			
		||||
        return null;
 | 
			
		||||
    }
 | 
			
		||||
    ```
 | 
			
		||||
 | 
			
		||||
=== "TypeScript"
 | 
			
		||||
 | 
			
		||||
		Reference in New Issue
	
	Block a user