es6-algorithm 之 链表linkedList

实现如下

class Node {
   
  constructor (ele) {
    this.element = ele
    this.next = null
  }
}

const linkedList = (() => {
  class linkedList {
    constructor () {
      this.head = null
      this.length = 0
    }
    // 向链表尾部追加元素
    append (ele) {
      let node = new Node(ele)
      let current
      if (this.head === null) {
        this.head = node
      } else {
        current = this.head
        while (current.next) {
          current = current.next
        }
        current.next = node
      }
      this.length++
    }
    // 向链表特定位置插入一个新的项, 0~length
    insert (position, ele) {
      if (position