模拟实现Java链表数据结构

package com.qsh.singlelinkedlist;

public class SingleLinkedListDemo {

    public static void main(String[] args) {
        HeroNode hero1 = new HeroNode(1,"孙悟空");
        HeroNode hero2 = new HeroNode(2,"贝吉塔");
        HeroNode hero3 = new HeroNode(3,"克林");
        SingleLinkedList myHero = new SingleLinkedList();
        myHero.addNode(hero1);
        myHero.addNode(hero2);
        myHero.addNode(hero3);
        myHero.list();
    }
}


class SingleLinkedList{
    HeroNode heroHead = new HeroNode(0,"");
    public void addNode(HeroNode heroNode){
        HeroNode temp = heroHead;
        while(true){
            if(temp.next==null){
                break;
            }else {
                temp = temp.next;
            }
        }
        temp.next = heroNode;
    }

    public void list(){
        if(heroHead.next==null){
            System.out.println("链表为空");
            return;
        }
        HeroNode temp = heroHead;
        while(true){
            if(temp.next==null){
                break;
            }else {
                temp =temp.next;
                System.out.println(temp);
            }
        }
    }
}



class HeroNode{
    int no;
    String name;
    HeroNode next;
    public HeroNode(int no,String name){
        this.no = no;
        this.name = name;
    }
    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }
}