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(8, "小夫", "夫仔");
SingleLinkedList singleLinkedList = new SingleLinkedList();
singleLinkedList.add(hero1);
singleLinkedList.add(hero2);
singleLinkedList.add(hero4);
// singleLinkedList.addByOrder(hero3);
// singleLinkedList.addByOrder(hero1);
// singleLinkedList.addByOrder(hero3);
// singleLinkedList.addByOrder(hero4);
// singleLinkedList.update(hero5);
singleLinkedList.delete(4);
singleLinkedList.delete(2);
singleLinkedList.delete(1);
singleLinkedList.delete(1);
singleLinkedList.list();
}
}

//定義單鏈表，管理英雄
class SingleLinkedList{
//新增頭節點
private HeroNode head=new HeroNode(0,"","");
//新增節點
//不考慮編號
//=尾部新增===
public void add(HeroNode heroNode){
// 頭節點不能動，建一個輔助變數
HeroNode temp=head;
while (true){
// 找到連結串列最後一個元素
if (temp.next==null){
break;
}
temp=temp.next;
}
temp.next=heroNode;
}

//=按照順序新增===
public void addByOrder(HeroNode heroNode){
HeroNode temp=head;
boolean flag=false;
while (true){
if (temp.nextnull){
break;
}
if (temp.next.no>heroNode.no){
break;
}else if (temp.next.noheroNode.no){
flag=true;
break;
}
temp=temp.next;//非常重要，不然連結串列是不會動的
}
if (flag==true){
System.out.println("資料已存在，請重新插入！");
}else{
heroNode.next=temp.next;
temp.next=heroNode;
}
}

//=根據編號修改節點資訊
public void update(HeroNode heroNode){
if (head.nextnull){
System.out.println("連結串列為空！");
return;
}
HeroNode temp=head;
boolean flag=false;
while (true){
if (temp.nextnull){
break;
}
if (temp.next.noheroNode.no){
flag=true;
break;
}
temp=temp.next;
}
if (flagtrue){
temp.next.name=heroNode.name;
temp.next.nickname=heroNode.nickname;
}else{
System.out.println("未找到該節點！");
}
}

//=刪除指定位置節點=
/*
找到需要刪除的節點的前一個節點，被刪除的節點不會有其他引用指向，被jvm垃圾回收
*/
public void delete(int no){
HeroNode temp=head;
boolean flag=false;
while (true){
if (temp.nextnull){
System.out.println("連結串列為空！");
return;
}
if (temp.next.nono){
flag=true;
break;
}
temp=temp.next;
}
if (flag==true){
temp.next=temp.next.next;
}else{
System.out.println("該節點不存在！");
}
}

public void list(){
if (head.nextnull){
return;
}
//頭節點不能動 需要一個輔助變數
HeroNode temp=head.next;
while (true){
if (tempnull){
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 +
            '}';
}

}