java数据结构：单向链表

package LinkedList;

public class SingleLinkedListDemo {
    public static void main(String[] args) {

        HeroNode hero1 = new HeroNode(1,"松江","及时雨");
        HeroNode hero2 = new HeroNode(2,"卢俊义","玉麒麟");
        HeroNode hero3 = new HeroNode(3,"吴用","智多星");
        HeroNode hero4 = new HeroNode(4,"林冲","豹子头");
        HeroNode hero5 = new HeroNode(1,"潘虎","及时雨");
        SingleLinkedList singleLinkedList =  new SingleLinkedList();
       //测试一
        /*singleLinkedList.add(hero1);
        singleLinkedList.add(hero2);
        singleLinkedList.add(hero3);
        singleLinkedList.add(hero4);*/
        //测试二
        singleLinkedList.addByOrder(hero3);
        singleLinkedList.addByOrder(hero1);
        singleLinkedList.addByOrder(hero2);
        singleLinkedList.addByOrder(hero4);


        singleLinkedList.update(hero5);
        singleLinkedList.delete(hero5);
        singleLinkedList.list();

    }
}

//定义SingleLinkedList 管理英雄
class SingleLinkedList{
    //先初始化一个头节点，头节点不要动，不存放具体的数据
    private HeroNode head = new HeroNode(0,"","");

    public int length(){
        return 0 ;
    }
    //添加节点到单向链表（找到节点的前一位）
    public void add(HeroNode heroNode){
        //头节点不动，所以设计辅助指针（变量） 帮助找到添加位置
        HeroNode temp = head;
        while(true){
            //找到链表的最后
            if(temp.next== null){
                break;
            }
            temp = temp.next;
        }
        //当退出while循环时，temp就指向了链表的最后
        temp.next = heroNode;
    }
    //根据排名添加节点（找到节点的前一位）
    public void addByOrder(HeroNode heroNode){
        HeroNode temp = head;
        boolean flag = false;//判断添加的编号是否已存在
        while(true){
            if(temp.next == null){
                break;
            }
            if(temp.next.no>heroNode.no){
                break;
            }else if(temp.next.no == heroNode.no){
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if(flag){
            System.out.println("准备插入的英雄编号已经存在,不能加入！");
        }else{
            heroNode.next = temp.next;
            temp.next = heroNode;
        }
    }

    //修改节点，根据no编号来修改
    public void update(HeroNode heroNode){
        //先判断是否为空
        if(head.next == null){
            System.out.println("链表为空");
            return;
        }
        HeroNode temp = head.next;
        boolean flag = false; //判断添加的编号是否已存在
        while(true){
            if(temp.next == null){
                break;
            }
            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(HeroNode heroNode){
        if(head.next == null){
            System.out.println("链表为空");
            return;
        }
        HeroNode temp = head;
        boolean flag = false; //判断添加的编号是否已存在
        while(true){
            if(temp.next == null){
                break;
            }
            if(temp.next.no == heroNode.no){
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if(flag){
            temp.next = temp.next.next;
        }else{
            System.out.println("未找到");
        }
    }
    //显示遍历
    public void list(){
        //先判断是否为空
        if(head.next == null){
            System.out.println("链表为空");
            return;
        }
        HeroNode temp = head.next;
        while(true){
            if(temp == null){
                break;
            }
            System.out.println(temp);
            //后移
            temp=temp.next;
        }
    }


}
//HeroNode
class HeroNode{
    public int no;
    public String name;
    public String nickname;
    public HeroNode next;

    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 + '\'' +

                '}';
    }
}