双向链表

代码实现

package com.springboot.dataStructure.linkedList;

import java.util.Stack;

/**
 * @author: 牧羊
 * @Date: 2020/4/18 23:44
 * 双向链表
 */
public class DoubleLinkedListDemo {

    public static void main(String[] args) throws Exception {

        HeroNode2 heroNode1 = new HeroNode2(1, "宋江", "及时雨");
        HeroNode2 heroNode2 = new HeroNode2(2, "卢俊义", "玉麒麟");
        HeroNode2 heroNode3 = new HeroNode2(3, "吴用", "智多星");
        HeroNode2 heroNode4 = new HeroNode2(4, "林冲", "豹子头");

        DoubleLinkedList linkedList = new DoubleLinkedList();
        linkedList.add(heroNode1);
        linkedList.add(heroNode2);
        linkedList.add(heroNode4);

        linkedList.addByOrder(heroNode3);
        linkedList.list();


    }

}

class DoubleLinkedList{

    //先初始化一个头结点，头结点不要动，不存放具体的数据
    private HeroNode2 head = new HeroNode2(0,"","");

    //返回头结点
    public HeroNode2 getHead(){
        return head;
    }

    //遍历双向节点
    public void list(){
        if(head == null){
            System.out.println("链表为空");
        }

        HeroNode2 temp = head.naxt;

        while (true){
            if(temp == null){
                break;
            }
            System.out.println(temp.toString());
            temp = temp.naxt;
        }
    }

    //添加一个节点到双向链表的最后
    //思路，当不考虑编号顺序的时候
    //1：找到链表最后的节点
    //2：将最后节点的naxt指向新的节点当中
    //3：将最后节点的pre指向上一个节点
    public void add(HeroNode2 node){
        //因为head不能动，因此我们需要一个辅助遍历temp
        HeroNode2 temp = head;

        while (true){
            //链表的最后
            if(temp.naxt == null){
                break;
            }
            //如果没有找到最后，将temp后移
            temp = temp.naxt;
        }
        temp.naxt = node;
        node.pre = temp;
    }

    public void update(HeroNode2 node){

        if(head.naxt == null){
            System.out.println("链表为空");
            return;
        }

        HeroNode2 temp = head;

        while (true){
            if(temp.no == node.no){
                temp.name = node.name;
                temp.niceName = node.niceName;
                break;
            }
            if(temp.naxt == null){
                System.out.println("编号不存在");
                break;
            }
            temp = temp.naxt;
        }
    }

    //从双向链表删除一个节点
    //删除节点
    public void remove(int no){

        HeroNode2 temp = head.naxt;

        if(head.naxt == null){
            System.out.println("链表为空");
            return;
        }

        while (true){
            if(temp == null){
                System.out.println("编号不存在");
                break;
            }
            if(temp.no == no){
                temp.pre.naxt = temp.naxt;
                if(temp.naxt != null){
                    temp.naxt.pre = temp.pre;
                }
                break;
            }
            temp = temp.naxt;

        }
    }

    //按照编号顺序存储
    //第二种方式，根据排名，将英雄插入到指定的位置
    //如果有排名，则添加失败
    public void addByOrder(HeroNode2 node){

        HeroNode2 temp = head.naxt;

        while (true){
            //遍历到最后
            if(temp.naxt == null){
                node.pre = temp;
                temp.naxt = node;
                break;
            }

            if(temp.naxt.no > node.no){
                node.naxt = temp.naxt;
                node.naxt.pre = node;
                node.pre = temp;
                temp.naxt = node;
                break;
            }else if(temp.naxt.no == node.no){
                System.out.println("编号已存在");
                break;
            }
            temp = temp.naxt;
        }
    }

}

class HeroNode2{
    public int no;
    public String name;
    public String niceName;
    public HeroNode2 naxt;
    public HeroNode2 pre;

    public HeroNode2(int no,String name,String niceName){
        this.no = no;
        this.name = name;
        this.niceName = niceName;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                ", niceName='" + niceName + '}';
    }

}