数据结构和算法 （javascript版本）之列表

列表

概述

1.列表的抽象

具体代码实现

function List(){
this.listSize = 0;
this.pos = 0;
this.dataStore =[];//初始化一个空数组
this.clear = clear;
this.find = find;
this.toString = toString;
this.insert = insert;
this.append = append;
this.remove = remove;
this.front = front;
this.end = end;
this.prev = prev;
this.next = next;
this.length = length;
this.currPos = currPos;
this.moveTo = moveTo;
this.getElement = getElement;
this.contains = contains;
function find(element){
for (var i = 0; i < this.dataStore.length; i++) {
if(this.dataStore[i] ==element){
return i;
}
}
return -1;
}
function append(element){
this.dataStore[this.listSize++] = element;
}
function remove(element){
var foundAt = this.find(element);
if(foundAt > -1){
this.dataStore.splice(foundAt,1);
--this.listSize;
return true;
}
return false;
}
function length(){
return this.listSize;
}
function toString(){
return this.dataStore;
}
function insert(element,after){
var insertPos = this.find(element);
if(insertPos > -1){
this.dataStore.splice(insertPos,0,element);
++this.listSize;
return true;
}
return false;
}
function clear(){
delete this.dataStore;
this.dataStore = [];
this.listSize = this.pos= 0;
}
function contains(element){
for (var i = 0; i < this.dataStore.length; i++) {
if(this.dataStore[i] == element){
return true;
}
}
return false;
}
function front(){
this.pos = 0;
}
function end(){
this.pos = this.listSize-1;
}
function prev(){
if(this.pos >0){
--this.pos;
}
}
function next(){
if(this.pos < this.listSize-1){
++this.pos;
}
}
function currPos(){
return this.pos;
}
function moveTo(position){
this.pos = position;
}
function getElement(){
return this.dataStore[this.pos];
}
}
/*
var movies = read('movies.txt');
alert(movies);*/