双向链表的增删改查

1. 实体类

// DoubleHeroNode, 每个定义DoubleHeroNode 对象就是一个节点
class DoubleHeroNode {
    public int no;
    public String name;
    public String nickname;
    public DoubleHeroNode pre;  //指向上一个节点
    public DoubleHeroNode next;  // 指向下一个节点

    //构造器
    public DoubleHeroNode(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 + '\'' +
                '}';
    }
}

2. 工具类

class DoubleLinkedList{

    //尾部增加
    public void add(DoubleHeroNode head,DoubleHeroNode heroNode){
        DoubleHeroNode temp = head;
        boolean flag = false;
        while (temp.next != null){
            if(temp.no == heroNode.no){
                flag = true;
                return;
            }
            temp = temp.next;
        }
        if (flag){
            System.out.println("您要添加的数据已存在~~");
        }else {
            temp.next = heroNode;
            heroNode.pre = temp;
        }
    }

    //顺序添加
    public void addByOrder(DoubleHeroNode head,DoubleHeroNode heroNode){
        DoubleHeroNode temp = head;
        boolean flag = false;
        while (temp.next != null){
            if (temp.next.no > heroNode.no){
                break;
            }else if (temp.next.no == heroNode.no){
                flag = true;
            }
            temp = temp.next;
        }
        if (flag){
            System.out.println("要插入的数据已存在");
        }else {
            if (temp.next != null){
                temp.next.pre = heroNode;
                heroNode.next = temp.next;
            }
            temp.next = heroNode;
            heroNode.pre = temp;
        }
    }

    //更新
    public void update(DoubleHeroNode head,DoubleHeroNode heroNode){
        DoubleHeroNode temp = head.next;
        boolean flag = false;
        while (temp != null){
            if (temp.no == heroNode.no ){
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if (flag){
            temp.name = heroNode.name;
            temp.nickname = heroNode.nickname;
        }else {
            System.out.println("未找到要更新的数据！");
        }
    }

    //删除
    public void delete(DoubleHeroNode head,int no){
        DoubleHeroNode temp = head.next;
        boolean flag = false;
        while (temp != null){
            if (temp.no == no){
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if (flag){
            temp.pre.next = temp.next;
            //如果temp为最后一个节点
            if (temp.next != null){
                temp.next.pre = temp.pre;
            }

        }else {
            System.out.println("未找到要删除的数据！");
        }
    }

    //显示链表
    public void show(DoubleHeroNode head){
        //判断链表是否为空
        if (head.next == null){
            System.out.println("链表为空~");
            return;
        }
        DoubleHeroNode temp = head.next;
        //用temp遍历链表
        while (temp != null){
            System.out.println(temp);
            temp = temp.next;
        }
    }
}

3. 测试

//双向链表的增、删、改、查。
public class DoubleLinkedListDemo {
    //初始化头节点
    private static DoubleHeroNode head = new DoubleHeroNode(0,"","");
    public static DoubleLinkedList list = new DoubleLinkedList();
    public static void main(String[] args) {

        //进行测试
        //先创建节点
        DoubleHeroNode heroNode1 = new DoubleHeroNode(1,"宋江", "及时雨");
        DoubleHeroNode heroNode2 = new DoubleHeroNode(2,"卢俊义", "玉麒麟");
        DoubleHeroNode heroNode3 = new DoubleHeroNode(3,"吴用", "智多星");
        DoubleHeroNode heroNode4 = new DoubleHeroNode(4,"林冲", "豹子头");
        //添加测试
        /*list.add(head,heroNode1);
        list.add(head,heroNode2);
        list.add(head,heroNode3);
        list.add(head,heroNode4);
        list.show(head);*/
        //顺序添加测试
        /*list.addByOrder(head,heroNode1);
        list.addByOrder(head,heroNode4);
        list.addByOrder(head,heroNode3);
        list.addByOrder(head,heroNode2);
        list.show(head);*/
        //更新测试
        /*list.update(head,new DoubleHeroNode(5,"小卢","小麒麟"));
        System.out.println("更新后的数据");
        list.show(head);*/

        //删除测试
        /*list.delete(head,2);
        System.out.println("删除后的数据");
        list.show(head);*/

    }
}