单链表的创建

class SingleLinkedList{
       private HeroNode head = new HeroNode(0,"","");//头节点，不存放数据
        public void addByOrder(HeroNode heroNode){
        HeroNode temp = head;
        boolean flag = false;//标志添加的编号是否存在
        while (true){
            if(temp.next == null)
            {break;}
                if(temp.no > heroNode.no)
                { break;}
                if(temp.no  == heroNode.no)
                {flag = true;
                    break;}
                temp = temp.next;
        }
        if(flag){
            System.out.println("不能添加");
        }
        heroNode.next = temp.next;
        temp.next = heroNode;
        }
        public void showQueue(){
           if(head.next == null)
           {
               System.out.println("空");
           }
           HeroNode temp = head;
           while (true){
               if(temp.next == null){
                 break;
               }
               System.out.println(temp);
               temp = temp.next;
           }
        }
        public void deleteQueue(HeroNode heroNode){
            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){
                heroNode.next = temp.next.next;
            }else {
                System.out.println("不存在要删除的节点");
            }
        }
        public void updateQueue(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.name = heroNode.name;
                temp.next.nickname = head.nickname;
            }
        }

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