数据结构38-链表insert方法实现 

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>链表操作</title>
</head>
<body>
    <script>
        function LinkList(){
            function Node(data){
                this.data=data
                this.next=null
            }
            //属性
            this.head=null
            this.length=0

            LinkList.prototype.append=function(data){
                //创建新的节点
                var newNode=new Node(data)
                if(this.length==0){
                    
                    this.head=newNode
                }else{
                    var current =this.head
                    while(current.next){
                        current=current.next
                    }
                    current.next=newNode
                }
                this.length+=1
            }
            //toString()
            LinkList.prototype.toString=function(){
                //定义变量
                var current=this.head
                //
                var listString=""
                while(current){
                    listString+=current.data+" "
                    current=current.next
                }
                return listString

            }
            //insert方法
            LinkList.prototype.toString=function(position,data){
                if(position<0||position>this.length) return false

                //根据data创建节点
                var newNode=new Node(data)

                //
                if(position==0){
                    newNode.next=this.head
                    this.head=newNode
                }else{
                    var index=0
                    var current=head
                    var previous=null
                    while(index++<position){
                        previous=current
                        current=current.next
                    }
                    newNode.next=current
                    previous.next=newNode
                }
                this.length++
                return true

            }

        }
    </script>
</body>
</html>

posted @ 2022-12-12 16:27  前端导师歌谣  阅读(34)  评论(0)    收藏  举报