JavaScript Linked List Code and Result

Source Code

        
// 定义链表节点类
class ListNode {
    constructor(value) {
        this.value = value;
        this.next = null;
    }
}

// 定义链表类
class Dfs {
    constructor() {
        this.head = null;
    }

    append(value) {
        const newNode = new ListNode(value);
        if (!this.head) {
            this.head = newNode;
        } else {
            let current = this.head;
            while (current.next) {
                current = current.next;
            }
            current.next = newNode;
        }
    }

    traverse() {
        let current = this.head;
        const result = [];
        while (current) {
            result.push(current.value);
            current = current.next;
        }
        return result;
    }
}

const linkedList = new Dfs();
for (let i = 0; i < 100; i++) {
    const randomValue = Math.floor(Math.random() * 100);
    linkedList.append(randomValue);
}

const output = linkedList.traverse();
const resultElement = document.getElementById('result');
resultElement.textContent = output.join(', ');
        
    

Running Result



    
    
    返回主页