【java】数据结构——双向链表

public class DoubleLinkedListDemo {
    public static void main(String[] args) {
        System.out.println("双向链表~~~");
        //创建结点
        HeroNode hero1 = new HeroNode(1,"陈二","小陈");
        HeroNode hero2 = new HeroNode(2,"张三","小张");
        HeroNode hero3 = new HeroNode(3,"李四","小李");
        HeroNode hero4 = new HeroNode(4,"王五","小王");

        //创建一个双向链表
        DoubleLinkdedList doubleLinkdedList = new DoubleLinkdedList();
        /*doubleLinkdedList.add(hero1);
        doubleLinkdedList.add(hero2);
        doubleLinkdedList.add(hero3);
        doubleLinkdedList.add(hero4);*/
        //按顺序添加
        doubleLinkdedList.addByOrder(hero1);
        doubleLinkdedList.addByOrder(hero4);
        doubleLinkdedList.addByOrder(hero2);
        doubleLinkdedList.addByOrder(hero3);

        doubleLinkdedList.list();

        //修改
        HeroNode updHero4 = new HeroNode(4,"王小五","小王五");
        doubleLinkdedList.update(updHero4);
        System.out.println("修改后~~");
        doubleLinkdedList.list();

        //删除
        doubleLinkdedList.del(3);
        System.out.println("删除后~~");
        doubleLinkdedList.list();
    }
}
//创建一个双向链表的类
class DoubleLinkdedList{
    //初始化一个头结点,不动它，不存放数据
    private HeroNode head = new HeroNode(0,"","");
    //返回一个头结点
    public HeroNode getHeroNode(){
        return head;
    }
    //遍历链表，和遍历单向链表一样
    public void list(){
        if (head.next == null){
            System.out.println("链表为空！");
            return;
        }
        //头结点不能动，所以需要一个辅助变量来遍历
        HeroNode temp = head.next;
        while (temp!=null){
            System.out.println(temp);//输出结点信息
            temp = temp.next;//temp后移
        }
    }
    //添加
    public void add(HeroNode heroNode){
        //头结点不能动，需要一个辅助变量temp
        HeroNode temp = head;
        //遍历链表，找到最后
        while (true){
            if (temp.next == null){
                break;
            }
            temp = temp.next;//temp后移
        }
        temp.next = heroNode;
        heroNode.pre = temp;
    }

    //按顺序添加
    public void addByOrder(HeroNode heroNode){
        HeroNode temp = head;//头指针不能动，用temp辅助变量来找到添加的位置
        boolean flag = false;//表示添加的编号是否存在，默认不存在-->false
        while (true){
            if (temp.next == null){//temp已经走到链表最后
                break;
            }if (temp.next.no > heroNode.no){//temp的后面一个比hero的大，所以hero需要添加到temp和temp.next之间
                break;
            }if (temp.next.no == heroNode.no){
                flag =true;//编号存在
                break;
            }
            temp = temp.next;//temp后移
        }
        if (flag){
            System.out.printf("添加失败，准备插入的编号%d已存在",heroNode.no);
        }else {
            heroNode.next = temp.next;
            temp.next = heroNode;
            heroNode.pre = temp;
        }
    }

    //修改
    public void update(HeroNode newHeroNode){
        //判断是否为空
        if (head.next == null){
            System.out.println("链表为空！");
            return;
        }
        HeroNode temp = head.next;
        boolean flag = false;//表示是否找到该节点
        while (true){
            if (temp == null){
                break;//已经遍历完链表
            }if (temp.no == newHeroNode.no){
                flag = true;//找到
                break;
            }
            temp = temp.next;
        }
        if (flag){//根据flag看是否找到要修改的结点
            temp.name = newHeroNode.name;
            temp.nickName = newHeroNode.nickName;
        }else System.out.printf("没有找到编号%d的结点,不能修改\n",newHeroNode.no);
    }

    //从双向链表中删除一个结点
    //1.双向链表可以直接找到要删除的结点
    //2.找到后自我删除即可
    public void del(int no){
        //判断链表是否为空
        if (head.next == null){
            System.out.println("链表为空！");
            return;
        }
        HeroNode temp = head.next;
        boolean flag = false;//表示是否找到带删除的结点
        while (true){
            if (temp == null){//已经遍历到链表最后
                break;
            }
            if (temp.no == no){//找到待删除结点
                 flag = true;
                 break;
            }
            temp = temp.next;//temp后移
        }
        if (flag){
            //temp.next = temp.next.next;//单向链表删除的方式
            temp.pre.next = temp.next;
            if (temp.next != null){
                temp.next.pre= temp.pre;
            }
        }else System.out.printf("要删除的%d结点不存在\n",no);
    }
}

class HeroNode{//每个heroNode就是一个结点
    public int no;
    public String name;
    public String nickName;
    public HeroNode next;//指向下一个结点,默认为null
    public HeroNode pre;//指向前一个结点，默认为null

    public HeroNode(int no, String name, String nickName) {
        this.no = no;
        this.name = name;
        this.nickName = nickName;
    }

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

---

鸣谢：尚硅谷教育