18 Star 19 Fork 2

zhoutk / jsDataStructs

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
LinkedList.js 2.52 KB
一键复制 编辑 原始数据 按行查看 历史
zhoutk 提交于 2015-09-28 10:44 . add push target.
/***************************************************************************
> File Name : LinkedList.js
> Author : zhoutk
> Mail : zhoutk@189.cn
> Create Time : 2015-09-18 10:23
***************************************************************************/
(function(){
"use strict";
var Node = require("./lib/SingleNode");
function LinkedList(){
this._head = new Node("This is Head Node.");
this._size = 0;
}
LinkedList.prototype.isEmpty = function(){
return this._size === 0;
};
LinkedList.prototype.size = function(){
return this._size;
};
LinkedList.prototype.getHead = function(){
return this._head;
};
LinkedList.prototype.display = function(){
var currNode = this.getHead().next;
while(currNode){
console.log(currNode.element);
currNode = currNode.next;
}
};
LinkedList.prototype.remove = function(item){
if(item) {
var preNode = this.findPre(item);
if(preNode == null)
return ;
if (preNode.next !== null) {
preNode.next = preNode.next.next;
this._size--;
}
}
};
LinkedList.prototype.add = function(item){
this.insert(item);
};
LinkedList.prototype.insert = function(newElement, item){
var newNode = new Node(newElement);
var finder = item ? this.find(item) : null;
if(!finder){
var last = this.findLast();
last.next = newNode;
}
else{
newNode.next = finder.next;
finder.next = newNode;
}
this._size++;
};
/*********************** Utility Functions ********************************/
LinkedList.prototype.findLast = function(){
var currNode = this.getHead();
while(currNode.next){
currNode = currNode.next;
}
return currNode;
};
LinkedList.prototype.findPre = function(item){
var currNode = this.getHead();
while(currNode.next !== null && currNode.next.element !== item){
currNode = currNode.next;
}
return currNode;
};
LinkedList.prototype.find = function(item){
if(item == null)
return null;
var currNode = this.getHead();
while(currNode && currNode.element !== item){
currNode = currNode.next;
}
return currNode;
};
module.exports = LinkedList;
})();
NodeJS
1
https://gitee.com/zhoutk/jsDataStructs.git
git@gitee.com:zhoutk/jsDataStructs.git
zhoutk
jsDataStructs
jsDataStructs
master

搜索帮助