JS基于對(duì)象的鏈表實(shí)現(xiàn)與使用方法示例

/*JS實(shí)現(xiàn)一個(gè)基于對(duì)象的鏈表*/
function Node(element){
 this.element = element;//節(jié)點(diǎn)存儲(chǔ)的元素
 this.next = null;//節(jié)點(diǎn)指向的下一個(gè)節(jié)點(diǎn)，這里先設(shè)置為空
}
function LList(){
 this.head = new Node("head");//生成一個(gè)頭節(jié)點(diǎn)
 this.find = find;//在鏈表中找到某個(gè)節(jié)點(diǎn)
 this.insert = insert;//在鏈表中某個(gè)元素后面插入某個(gè)節(jié)點(diǎn)元素
 this.display = display;//在將鏈表中的節(jié)點(diǎn)元素顯示出來
 this.findPrevious = findPrevious;//找到某個(gè)節(jié)點(diǎn)的上一個(gè)節(jié)點(diǎn)
 this.remove = remove;//刪除某個(gè)節(jié)點(diǎn)
}
function remove(item) {
 var prevNode = this.findPrevious(item);
 if (!(prevNode.next == null)) {
 prevNode.next = prevNode.next.next;
 }
}
function findPrevious(item) {
 var currNode = this.head;
 while (!(currNode.next == null) &&
 (currNode.next.element != item)) {
 currNode = currNode.next;
 }
 return currNode;
}
function display() {
 var currNode = this.head;
 var nodestr = "";
 while (!(currNode.next == null)) {
 nodestr +=" "+currNode.next.element;
 currNode = currNode.next;
 }
 console.log(nodestr);
}
function find(item) {
 var currNode = this.head;
 while (currNode.element != item) {
 currNode = currNode.next;
 }
 return currNode;
}
function insert(newElement, item) {
 var newNode = new Node(newElement);
 var current = this.find(item);
 newNode.next = current.next;
 current.next = newNode;
}
/*測(cè)試?yán)?/
var num = new LList();
num.insert("a1","head");
num.insert("b1","a1");
num.insert("c1","b1");
num.display();// a1 b1 c1
num.remove("b1");
num.display();// a1 c1