用于在链接列表中搜索元素的 JavaScript 程序

Linked list: 10 -> 20 -> 30 -> 40 -> null Input: 40 Output: Element found at index 3 Input: 10 Output: Element found at index 0 Input: null Output: Element not found

// Define the Node class for a singly linked list class Node { constructor(data) { this.data = data; this.next = null; } } // Define the LinkedList class class LinkedList { constructor() { this.head = null; this.size = 0; } // Add an element to the linked list add(element) { const node = new Node(element); // If the linked list is empty, set the new node as the head if (this.head === null) { this.head = node; } else { // Traverse to the end of the linked list and add the new node let current = this.head; while (current.next !== null) { current = current.next; } current.next = node; } this.size++; } // Search for an element in the linked list search(element) { let current = this.head; let index = 0; // Traverse through the linked list until the element is found while (current !== null) { if (current.data === element) { return `Element found at index ${index}`; } current = current.next; index++; } return "Element not found"; } } // Create a new linked list const ll = new LinkedList(); // Add elements to the linked list ll.add(10); ll.add(20); ll.add(30); ll.add(40); ll.add(50); // Search for an element in the linked list const result = ll.search(30); console.log(result);