使用js实现链表

       链表是一种动态的数据结构，不同于数组的是，链表分配内存空间的灵活性，它不会像数组一样被分配一块连续的内存。当你想在数组的任意位置，插入一个新值的时候，必须对数组中的各个元素进行相应的位置移动才能达到目标，开销显然是很大的。然而链表的灵活性在于它的每个元素节点分为两部分，一部分是存储元素本身，另一部分是指向下一个节点元素的引用，也可以称为指针，当你要插入数据时，把上一个节点的向下指针指向新数据节点，新数据节点的向下指针指向原有数据。但是链表不像数组那样可以直接通过索引立刻定位，只能通过遍历。

• 单链表

function List() {       
    this.head = new Node("head");
    this.find = find;
    this.insert = insert;
    this.remove = remove;
    this.getAll= getAll;
    this.findPrevious = findPrevious;        
}

function Node(element) {
    this.element = element;
    this.next = null;
}

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);
    if(current == null) 
        return console.log("can't find the item");
    newNode.next = current.next;
    current.next = newNode;
}

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 getAll() {
    var current = this.head;
    while(current.next != null) {
        console.log(current.next.element);
        current = current.next;
    }
}

• 双向链表

function LList() {           
    this.head = new LNode("head");
    this.findLast = findLast;
    this.insert = insert;
    this.remove = remove;
    this.getAll = getAll;
}

function LNode(element) {     //双向链表结点
    this.element = element;
    this.next = null;
    this.prev = null;
}

function insert(newElement.item) {
    var newNode = new Node(newElement);
    var current = this.find(item);
    newNode.next = current.next;
    current.next.prev = newNode;
    newNode.prev = current;
    current.next = newNode;
}

function remove(item) {
    var current = this.find(item);
    if(current.next != null) {
        current.prev.next = current.next;
        current.next.prev = current.prev;
        current.next = null;
        current.prev = null;
    }   
}

function findLast() {
    var currNode = this.head;
    while(current.next != null) {
        current = current.next;
    }
    return current;
}

function dispReverse() {            //反序显示双向链表的元素
    var currNode = this.findLast();
    while(currNode.prev != null) {
        console.log(currNode.element);
        currNode = currNode.prev;
    }
}

• 循环链表

function CList() {                 
    this.head = new Node("head");
    this.head.next = this.head;
}