四、双链表

      单向链表缺点：
      1.查找的方向只能是一个方向，而双向链表可以向前或者向后查找。
      2.单向链表不能自我删除，需要靠辅助节点，而双向链表可以自我删除

实验代码：

package DoubleLinkedList;

public class DoubleLinkedListDemo {
    public static void main(String[] args) {
        HeroNode2 heroNode1 = new HeroNode2(1, "宋江", "及时雨");
        HeroNode2 heroNode2 = new HeroNode2(2, "卢俊义", "玉麒麟");
        HeroNode2 heroNode3 = new HeroNode2(3, "吴用", "智多星");
        HeroNode2 heroNode4 = new HeroNode2(4, "林冲", "豹子头");
        DoubleLinkedList doubleLinkedList = new DoubleLinkedList();
        doubleLinkedList.add(heroNode1);
        doubleLinkedList.add(heroNode2);
        doubleLinkedList.add(heroNode3);
        doubleLinkedList.add(heroNode4);

        doubleLinkedList.list();

      //修改测试
        System.out.println("修改测试：");
        HeroNode2 newHeroNode = new HeroNode2(4, "公孙胜", "入云龙");
        doubleLinkedList.update(newHeroNode);
        doubleLinkedList.list();

        //删除测试
        System.out.println("删除测试：");
        doubleLinkedList.del(3);
        doubleLinkedList.list();

        //按顺序添加测试
        System.out.println("按顺序添加测试：");
        doubleLinkedList.addByorder(heroNode3);
        doubleLinkedList.list();
    }
}


//创建一个双向链表的类
class DoubleLinkedList{
    //先初始化一个头节点，不存放具体数据
    private HeroNode2 head = new HeroNode2(0,"","");

    //返回头节点
    public HeroNode2 getHead(){

        return head;
    }

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

        HeroNode2 temp = head.next;
        while(true){
            if(temp == null){
                break;
            }
            System.out.println(temp);
            temp = temp.next;
        }
    }

    //尾部添加元素
    public void add(HeroNode2 heroNode){
        HeroNode2 temp = head;
        while(true){
            if((temp.next) == null)
                break;
            temp = temp.next;
        }
        temp.next = heroNode;
        heroNode.pre = temp;
    }


    //修改双向链表
    public void update(HeroNode2 newHeroNode){
        if(head.next == null){
            System.out.println("链表为空");
            return;
        }
        HeroNode2 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){
            temp.name = newHeroNode.name;
            temp.nickname = newHeroNode.nickname;
        }else{
            System.out.printf("没有找到编号为%d的节点，不能修改");
        }

    }

    //删除双向链表中的一个节点
    public void del(int no){
        if(head.next == null){
            System.out.println("链表为空，无法删除");
            return;
        }
        HeroNode2 temp = head;
        boolean flag = false;
        //遍历，找到待删除节点temp
        while(true){
            if(temp == null){
                break;
            }
            if(temp.no == no){
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if(flag) {
            temp.pre.next = temp.next;
            if (temp.next != null) {
                temp.next.pre = temp.pre;
            }
        }else{
            System.out.printf("要删除的%d节点不存在\n",no);
        }
    }

    //按顺序添加
    public void addByorder(HeroNode2 heroNode){
        HeroNode2 temp = head;
        boolean flag = false;
        while(true){
            if(temp.next == null){
                break;
            }
            if(temp.no > heroNode.no){
                break;
            }else if(temp.no == heroNode.no){
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if(flag){
            System.out.printf("准备插入的英雄的编号%d已经存在，不能插入\n",heroNode.no);
        }else{
                heroNode.next = temp;
                heroNode.pre = temp.pre;
                temp.pre.next = heroNode;
                temp.pre = heroNode.next;
        }

    }

}


class HeroNode2{  //创建一个节点，定义Data域、Next域、pre域
    public int no;
    public String name;
    public String nickname;
    public HeroNode2 next;  //指向下一个节点
    public HeroNode2 pre;   //指向前一个节点

    public HeroNode2(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  +
                '}';
    }
}

测试结果：

HeroNode{no=1, name='宋江', nickname='及时雨}
HeroNode{no=2, name='卢俊义', nickname='玉麒麟}
HeroNode{no=3, name='吴用', nickname='智多星}
HeroNode{no=4, name='林冲', nickname='豹子头}
修改测试：
HeroNode{no=1, name='宋江', nickname='及时雨}
HeroNode{no=2, name='卢俊义', nickname='玉麒麟}
HeroNode{no=3, name='吴用', nickname='智多星}
HeroNode{no=4, name='公孙胜', nickname='入云龙}
删除测试：
HeroNode{no=1, name='宋江', nickname='及时雨}
HeroNode{no=2, name='卢俊义', nickname='玉麒麟}
HeroNode{no=4, name='公孙胜', nickname='入云龙}
按顺序添加测试：
HeroNode{no=1, name='宋江', nickname='及时雨}
HeroNode{no=2, name='卢俊义', nickname='玉麒麟}
HeroNode{no=3, name='吴用', nickname='智多星}
HeroNode{no=4, name='公孙胜', nickname='入云龙}