单链表的实现：探索一种简单高效的数据结构

2023-10-20 11:39:48

单链表是一种线性的数据结构，由一系列结点组成，每个结点包含一个数据元素和一个指向下一个结点的指针。这种结构使得单链表能够高效地进行数据的存储、访问、插入和删除操作。在JavaScript中，我们可以通过以下步骤来实现一个单链表：

定义结点类：

class Node {
  constructor(data) {
    this.data = data;
    this.next = null;
  }
}

定义单链表类：

class LinkedList {
  constructor() {
    this.head = null;
    this.size = 0;
  }
}

插入结点：

LinkedList.prototype.add = function(data) {
  const newNode = new Node(data);
  if (this.head === null) {
    this.head = newNode;
  } else {
    let current = this.head;
    while (current.next !== null) {
      current = current.next;
    }
    current.next = newNode;
  }
  this.size++;
};

删除结点：

LinkedList.prototype.remove = function(data) {
  if (this.head === null) {
    return;
  } else if (this.head.data === data) {
    this.head = this.head.next;
  } else {
    let current = this.head;
    let previous = null;
    while (current !== null && current.data !== data) {
      previous = current;
      current = current.next;
    }
    if (current !== null) {
      previous.next = current.next;
    }
  }
  this.size--;
};

查找结点：

LinkedList.prototype.indexOf = function(data) {
  let current = this.head;
  let index = 0;
  while (current !== null) {
    if (current.data === data) {
      return index;
    }
    index++;
    current = current.next;
  }
  return -1;
};

获取结点数据：

LinkedList.prototype.get = function(index) {
  if (index < 0 || index >= this.size) {
    return null;
  }
  let current = this.head;
  for (let i = 0; i < index; i++) {
    current = current.next;
  }
  return current.data;
};

设置结点数据：

LinkedList.prototype.set = function(index, data) {
  if (index < 0 || index >= this.size) {
    return;
  }
  let current = this.head;
  for (let i = 0; i < index; i++) {
    current = current.next;
  }
  current.data = data;
};

遍历结点：

LinkedList.prototype.forEach = function(callback) {
  let current = this.head;
  while (current !== null) {
    callback(current.data);
    current = current.next;
  }
};

单链表在 JavaScript 中有着广泛的应用，例如：