链表方法
add
element
get
Node
null
next
head
delete
deQuene () { return this.LinkList.delete(0) }
size
链表结构
队列
set
enQuene (data) { this.LinkList.add(data) }
链表的结构
_getNode(index) { if (index < 0 || index >= this.size) { throw new Error('越界') } let rNode = this.head; for (let i = 0; i < index; i++) { rNode = rNode.next } return rNode}
get (index) { return this._getNode(index)}
elementnext
_getNode(index)
delete (index) { let current = null if (index === 0) { current = this.head if (!current) return undefined this.head = current.next } else { let preve = this._getNode(index-1) current = preve.next preve.next = current.next } this.size-- return current}
constructor() { this.LinkList = new LinkList() }
私有方法
空链表
公有方法
