定義鏈表
鏈表是由一組節點組成的集合。每個節點都使用一個對象的引用指向它的后繼，指向另一個節點的引用叫做鏈
單向鏈表
Node類
- element用來保存節點上的數據
- next用來保存指向下一個節點的鏈接
function Node(element){
this.element = element;
this.next = null;
}
LinkedList類
function LList(){
this.head = new Node("head");//該鏈表的頭對象
this.find = find;//查找節點
this.insert = insert;//插入節點
this.remove = remove;//刪除節點
this.display = display;//展示鏈表節點
}
-
find
該方法遍歷鏈表，查找給定數據，如果找到數據，返回保存該數據的節點
function find(item){
var currNode = this.head;
while(currNode.element != item){
currNode = currNode.next;
}
return currNode;
}
- insert
function insert(newElement,item){
var newNode = new Node(newElement);
var current = this.find(item);
newNode.next = current.next;
current.next = newNode;
}
- display
function display(){
var currNode = this. head;
while(!(currNode.next)==null){
print(currNode.next.element);
currNode = currNode.next;
}
}
- findPrevious
function findPrevious(item){
var currNode = this.head;
while(!(currNode.next == null)&&(currNode.next.element != item)){
currNode = currNode.next;
}
return curNode;
}
- remove
function remove(item){
var prevNode = this.findPrevious(item);
if(!(prevNode.next == null)){
prevNode.next = prevNode.next.next
}
}
雙向鏈表
為Node類新增previous屬性
function Node(element){
this.element = element;
this.next = null;
this.previous = null;
}
-
insert
在原有基礎上需要設置新節點的previous屬性
function insert(newElement,item){
var newNode = new Node(newElement);
var current = this.find(item);
newNode.next = current.next;
newNode.previous = current;
current.next = newNode;
}
-
remove
不需要再查找上一節點了
function remove(item){
var currNode = this.find(item);
if(!(currNode.next == null)){
currNode.previous.next = currNode.next;
currNode.next.previous = currNode.previous;
currNode.next = null;
currNode.previous = null;
}
}
-
新增findLast方法
該方法用來查找最后的節點，便于以反序顯示鏈表中元素這類任務
function findLast(){
var currNode = this.head;
while(!(currNode.next == null)){
currNode = currNode.next;
}
return currNode;
}
- dispReverse
function dispReverse(){
var currNode = this.head;
currNode = this.findLast();
while(!(currNode.previous == null)){
print(currNode.element);
currNode = currNode.previous;
}
}
循環列表
循環列表和單向列表相似，節點類型都是一樣的。唯一區別是在創建循環鏈表是，讓其頭節點的next屬性指向它本身
- 修改LList類的構造函數
function LList(){
this.head = new Node("head");
this.head.next = this.head;
this.find = find;
this.insert = insert;
this.display = display;
this.findPrevious = findPrevious;
this.remove = remove;
}
-
修改display
需要檢查頭節點，當循環到頭節點時退出循環
function display(){
var currNode = this.head;
while(!(currNode.next == null)&&(currNode.next.element == "head")){
print(currNode.next.element);
currNdoe = currNode.next;
}
}
整理自《數據結構與算法Javascript》
