js链表的实现

1.新建一个Node 类

class Node {
  constructor(element, next) {
    this.element = element
    this.next = next === undefined ? null : next
  }
}

2.创建LinkedList类（里面包含插入节点、删除节点、查找节点位置方法）

class LinkedList {
  constructor() {
    this.size = 0
    this.head = null
  }
  // 插入节点
  append(element) {
    let node = new Node(element)
    if (this.head === null) {
      this.head = node
    } else {
      let current = this.getNode(this.size - 1)
      current.next = node 
    }

    this.size++ 
  }
  // 根据位置插入节点 
  appendAt(position, element) {
    if (position < 0 && position > this.size) {
      throw new Error('position out of range')
    }
    let node = new Node(element)
    if (position === 0) {
      node.next = this.head
      this.head = node
    } else {
      let pre = this.getNode(position - 1) 
      node.next = pre.next
      pre.next = node
    }

    this.size ++
  }
  // 根据位置删除节点
  removeAt(position) {
    if (position < 0 && position >= this.size) {
      throw new Error('position out of range')
    }

    if (position === 0) {
      let current = this.head
      this.head = current.next
    } else {
      let pre = this.getNode(position - 1)
      let current = this.getNode(position)
      pre.next = current.next
    }
    this.size--
  }
  // 查找node索引值
  indexOf(element) {
    let node = new Node(element)
    let current = this.head
    for (let i = 0; i < this.size; i ++) {
      if (node.element == current.element) {
        return i
      }
      current = current.next
    }
  }
  getNode(index) {
    if (index < 0 && index >= this.size) {
      throw new Error('out range')
    }
    let current = this.head
    for (let i = 0; i < index; i++) {
      current = current.next
    }

    return current
  }
}