双向链表增(按顺序增加、增加到末尾)删改代码

public class DoubleLinkedList {
    public static void main(String[] args) {
        HeroMan hero1 = new HeroMan(1, "冷清秋", "金燕西");
        HeroMan hero2 = new HeroMan(2, "柯南", "小兰");
        HeroMan hero3 = new HeroMan(3, "基德", "青子");
        DoubleLinked doubleLinked = new DoubleLinked();
       /* doubleLinked.addLinked1(hero1);
        doubleLinked.addLinked1(hero2);
        doubleLinked.addLinked1(hero3);*/
        doubleLinked.addByOrder(hero2);
        doubleLinked.addByOrder(hero3);
        doubleLinked.addByOrder(hero1);
        HeroMan hero4 = new HeroMan(3, "黑羽", "中森");
        doubleLinked.update(hero4);
        doubleLinked.del(2);
        doubleLinked.list();
    }
}


class DoubleLinked {
    private static HeroMan head = new HeroMan(0, "", "");

    public void list() {
        if (head.next == null) {
            System.out.println("双向链表为空");
        }
        HeroMan temp = head;
        while (true) {
            if (temp.next == null) {
                return;
            }
            temp = temp.next;
            System.out.println(temp);
        }
    }

    //    添加
    public void addLinked1(HeroMan hero) {
        HeroMan temp = head;
        while (true) {
            if (temp.next == null) {
                break;
            }
            temp = temp.next;
        }
        temp.next = hero;
        hero.pre = temp;
    }

    //    按照顺序添加
    public void addByOrder(HeroMan heroNode) {
        HeroMan temp = head;
        boolean flag = false;

        while (true) {
            if (temp.next == null) {
                break;
            }
            if (temp.next.id > heroNode.id) {
                break;
            } else if (temp.next.id == heroNode.id) {
                flag = true;
                break;
            }
            temp = temp.next;
        }

        if (flag) {// 不能添加,说明编号存在
            System.out.printf("准备插入的英雄的编号%d已经存在了,不能加入\n", heroNode.id);
        } else {
            if (temp.next == null) {
                temp.next = heroNode;
                heroNode.pre = temp;
            } else {
                //此处是在temp和temp.next中间添加数据
                heroNode.next = temp.next;
                temp.next.pre = heroNode;
                temp.next = heroNode;
                heroNode.pre = temp;
            }
        }
    }

    //    修改
    public void update(HeroMan newHero) {
        HeroMan temp = head;
        boolean flag = false;
        while (true) {
            if (temp.next == null) {
                break;
            }
            if (temp.next.id > newHero.id) {
                break;
            } else if (temp.next.id == newHero.id) {
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if (flag) {
            temp.next.name = newHero.name;
            temp.next.nickname = newHero.nickname;
        } else {
            System.out.println("找不到该编号");
        }
    }

    //    删除
    public void del(int id) {
        HeroMan temp = head.next;
        boolean flag = false;
        if (temp == null) {
            System.out.println("链表为空");
            return;
        }
        while (true) {
            if (temp == null) {
                break;
            }
            if (temp.id == id) {
                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.println("找不到编号删除" + id);
        }
    }
}

class HeroMan {
    public int id;
    public String name;
    public String nickname;
    public HeroMan next;
    public HeroMan pre;

    public HeroMan(int hid, String hname, String hnickname) {
        this.id = hid;
        this.name = hname;
        this.nickname = hnickname;
    }

    @Override
    public String toString() {
        return "[" +
                "id=" + id +
                ", name='" + name + '\'' +
                ", nickname='" + nickname + '\'' +
                ']';
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值