JavaScript实现双向链表的封装

function DoublyLinkedList(){
    //双向链表需要头指针尾指针
    this.head = null
    this.tail = null
    this.lenght = 0
    function Node(data){
        this.data = data;
        this.next = null;
        this.prev = null;
    }
    //向链表最后添加元素
    DoublyLinkedList.prototype.apped = function(element){
        let newNode = new Node(element)
        if(this.lenght === 0){
            this.head = newNode
            this.tail = newNode
        }else{
            newNode.prev= this.tail
            this.tail.next = newNode
            this.tail = newNode
        }
        this.lenght++
    }
    //重写toString方法
    DoublyLinkedList.prototype.toString = function(){
        return this.backwordString()
    }
    //逆向遍历链表
    DoublyLinkedList.prototype.forwordString = function(){
        let curred = this.tail
        let resultString = ""
        while(curred){
            resultString = resultString + curred.data + ' '
            curred = curred.prev
        }
        return resultString
    }
    //正向遍历链表
    DoublyLinkedList.prototype.backwordString = function(){
        let curred = this.head
        let resultString = ''
        while(curred){
            resultString = resultString + curred.data + ' '
            curred = curred.next
        }
        return resultString
    }
    //查找指定位置的元素
    DoublyLinkedList.prototype.get = function(position){
        let le = this.lenght / 2
        console.log(le);
        if(position < 0 || position >= this.lenght) return null
        if(position > le){
            let curred = this.tail
            let index = this.lenght - 1
            while(index-- > position){
                curred = curred.prev
            } 
            return curred.data
        }else{
            let curred = this.head
            let index = 0
            while(index++ < position){
                curred = curred.next
            }
            return curred.data
        }
    }
    //查看是否有某一元素
    DoublyLinkedList.prototype.indexOf = function(data){
        //从后往前找
        let curred = this.tail
        let index = 0
        while(curred){
            if(data === curred.data){
                return index
            }
            curred = curred.next
            index++
        }
        return -1
    }
    //修改某个位置的元素
    DoublyLinkedList.prototype.update = function(position,element){
        if(position < 0 || position >= this.lenght) return null
        let le = this.lenght / 2
        if(position > le){
            let curred = this.tail
            index = this.lenght - 1
            while(curred){
                if(index === position){
                    curred.data = element
                    return true 
                }
                curred = curred.prev
                index--
            }
        }else{
            let curred = this.head
            let index = 0
            while(curred){
                if(index === position){
                    curred.data = element
                    return true 
                }
                curred = curred.next
                index++
            }
        }
    }
    //移除特定位置的一项
    DoublyLinkedList.prototype.removeAt = function(position){
        if(position < 0 && position >= this.lenght) return null
        let le = this.lenght / 2
        if(position === 0){
            this.head = this.head.next
            this.head.next.prev = this.head
        }
        if(position > le){
            let curred = this.tail
            let index = this.lenght-1
            while(index-- > position){
                curred = curred.prev
            }
            curred.next.prev = curred.prev
            curred.prev.next = curred.next
        }else{
            let curred = this.head
            let index = 0
            while(index++ < position){
                curred = curred.next
            }
            curred.next.prev = curred.prev
            curred.prev.next = curred.next
        }
        this.lenght--
    }
    //移除指定数据
    DoublyLinkedList.prototype.remove = function(data){
        let curred = this.head
        while(curred){
            if(curred.data === data){
                curred.prev.next = curred.next
                curred.next.prev = curred.prev
                this.lenght--
                return true
            }
            curred = curred.next
        }
        return false
    }
    //判空
    DoublyLinkedList.prototype.isEmpty = function(){
        return !(this.lenght === 0)
    }
    //返回链表长度
    DoublyLinkedList.prototype.size = function(){
        return this.lenght
    }
}