package jiegou;

import java.util.List;

// 單鏈表
public class SingleLinkDemo {
    public static void main(String[] args) {
        HeroNode heroNode1 = new HeroNode(1, "松江", "及時雨");
        HeroNode heroNode2 = new HeroNode(2, "吳用", "智多星");
        HeroNode heroNode3 = new HeroNode(3, "林沖", "豹子頭");

        SingleLinkList linkList = new SingleLinkList();

        linkList.add(heroNode1);
        linkList.add(heroNode2);
        linkList.add(heroNode3);

        linkList.list();

    }
}

// 連結串列管理節點
class SingleLinkList {
    // 初始化一個頭節點
    private HeroNode head = new HeroNode(0, "", "");

    // 新增節點到單向連結串列
    public void add(HeroNode heroNode) {
        // 找到連結串列最後
        //將最後節點的 next 指向這個新節點
        HeroNode temp = head;
        //遍歷連結串列
        while (true) {
            // 當 temp.next== null
            if (temp.next == null) {
                break;
            }

            // 沒有找到最後  temp 後移
            temp = temp.next;
        }

        temp.next = heroNode;
    }

    // 顯示連結串列
    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;
        }
    }
}

// 節點
class HeroNode {
    public int no;
    public String name;
    public String nickname;
    public HeroNode next; //指向下一個節點

    // 構造方法
    public HeroNode(int hNo, String HName, String HNickName) {
        this.no = hNo;
        this.name = HName;
        this.nickname = HNickName;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                ", nickname='" + nickname + '\'' +
                '}';
    }

}