zoukankan      html  css  js  c++  java
  • 双向链表插入删除反序

    <!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>Document</title>
    </head>
    <body>
    <script>
    function ListNode(value){
    this.val = value
    this.pre = null
    this.next = null
    }
    class List {
    constructor(){
    this.HeadList = new ListNode('head')
    }
    find(item){
    let cur = this.HeadList
    while(cur.val != item){
    cur = cur.next
    }
    return cur
    }
    insert(node,item){
    let newnode = new ListNode(node)
    let cur = this.find(item)
    newnode.next = cur.next
    newnode.pre = cur
    cur.next = newnode
    if(newnode.next){
    newnode.next.pre = newnode
    }
     
    }
    display(){
    let cur = this.HeadList
    while(cur.next){
    console.log(cur.next.val)
    cur = cur.next
    }
    }
    remove(item){
    let cur = this.find(item)
    if(cur.next){
    cur.pre.next = cur.next
    cur.next.pre = cur.pre
    cur.next = null
    cur.pre = null
    }else{
    cur.pre.next = null
    cur.next = null
    }
    }
    findLast(){
    let cur = this.HeadList
    while(cur.next){
    cur = cur.next
    }
    return cur
    }
    rev(){
    let cur = this.findLast()
    while(cur.pre){
    console.log(cur.val)
    cur = cur.pre
    }
    }
    }
    let baic = new List()
    baic.insert('1','head')
    baic.insert('2','1')
    baic.insert('3','2')
    baic.insert('4','1')
    baic.display()
    console.log(baic,'^^__^^')
    baic.remove('4')
    baic.display()
    console.log('&&&&&')

    baic.rev()




    </script>
    </body>
    </html>
  • 相关阅读:
    P1093 奖学金
    『模板』快速排序
    [模板]选择排序&&冒泡排序&&插入排序
    CF898A Rounding
    计算细胞数【BFS】
    字符串匹配问题(lfyzoj)
    [HDU]4694 Important Sisters(支配树)
    [BZOJ]4650: [Noi2016]优秀的拆分
    [BZOJ]4908: [BeiJing2017]开车
    [洛谷]P3729 曼哈顿计划EX(最小割树/等价流树)
  • 原文地址:https://www.cnblogs.com/MDGE/p/14698552.html
Copyright © 2011-2022 走看看