数据结构 day_3

单链表

无排序 添加节点

public class LinkedListDemo {
    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,"林冲","豹子头");
        //创建单链表
        SingleLinkedList singleLinkedList = new SingleLinkedList();
        //将节点添加进链表中
        singleLinkedList.add(hero1);
        singleLinkedList.add(hero4);
        singleLinkedList.add(hero3);
        singleLinkedList.add(hero2);
        //显示
        singleLinkedList.list();
    }
}
class SingleLinkedList{
    //初始化一个头节点
    private HeroNode head = new HeroNode(0,"","");
    //添加节点到单链表
    //找到链表的最后一个节点,将最后这个节点的next 指向新的节点
    public void add(HeroNode heroNode){
        //头结点不能动 所以需要一个辅助变量 temp
        HeroNode temp = head;
        //遍历链表
        while(true){
            //找到最后
            if(temp.next == null){
                break;
            }
            //没找到,将temp后移
            temp = temp.next;
        }
        //退出while循环时,temp指向的是链表最后
        //将最后这个链表的next指向添加的新节点
        temp.next = heroNode;
    }
    //遍历链表
    public void list(){
        if(head.next==null){
            System.out.println("list is empty");
            return;
        }
        //头结点不能动
        HeroNode temp = head;
        while(true){
            if(temp == null){
                break;
            }
            System.out.println(temp); //因为重写了toString方法 可以直接输出temp
            //节点后移
            temp = temp.next;
        }
    }

}
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;
    }
    public String toString() {    //重写  toString方法
        return "HeroNode[no=" + no + " ,name = " + name + ", nickname =" + nickname+"]";
    }
}