package cn.mrlij.linkedlist;
/***
 * 單鏈表的實(shí)現(xiàn)
 * @author dreamer
 *
 */
public class SingleLinkedList {
 public static void main(String[] args) {
 SingleLinkedListDemo s = new SingleLinkedListDemo();
 HeroNode h1 = new HeroNode(1, "宋江", "及時(shí)雨");
 HeroNode h2 = new HeroNode(3, "盧俊義", "玉麒麟");
 HeroNode h3 = new HeroNode(4, "吳用", "智多星");
 HeroNode h4 = new HeroNode(2, "林沖", "豹子頭");
 s.addByOrder(h1);
 s.addByOrder(h2);
 s.addByOrder(h3);
 s.addByOrder(h4);
 System.out.println("修改前————");
 s.list();
// HeroNode h5 = new HeroNode(4, "有用", "超星星");
// s.update(h5);
 s.del(1);
 s.del(4);
 s.del(2);
 s.del(3);
 System.out.println("刪除后————");
 s.list();
 }
 
}
class SingleLinkedListDemo{
 //創(chuàng)建一個(gè)頭結(jié)點(diǎn)，初始化數(shù)據(jù)，頭結(jié)點(diǎn)不要?jiǎng)樱环啪唧w的數(shù)據(jù)
 private HeroNode head = new HeroNode(0,"","");
 //添加英雄
 public void add(HeroNode node) {
 //先找出最后的一個(gè)節(jié)點(diǎn)，把新加的節(jié)點(diǎn)放在最后一個(gè)節(jié)點(diǎn)的后面
 HeroNode temp = head;
 while(true) {
 if(temp.next == null) {
 break;
 }
 temp = temp.next;
 }
 temp.next = node;
 }
 public void addByOrder(HeroNode node) {
 HeroNode temp = head;
 boolean flag = false;
 while(true) {
 if(temp.next == null) {
 break;
 }
 if(temp.next.no>node.no) {
 break;
 }else if(temp.next.no == node.no) {
 flag = true;
 break;
 }
 temp = temp.next;
 }
 if(flag) {
 System.out.println("編號(hào)"+node.no+"已經(jīng)存在了！");
 }else {
 node.next = temp.next;
 temp.next = node;
 }
 }
 public void update(HeroNode node ) {
 if(head.next == null) {
 System.out.println("鏈表為空！");
 return;
 }
 HeroNode temp = head.next;
 boolean flag = false;
 while(true) {
 if(temp == null) {
 break;
 }
 if(temp.no == node.no) {
 flag = true;
 break;
 }
 temp = temp.next;
 }
 if(flag) {
 temp.name = node.name;
 temp.nickname = node.name;
 }else {
 System.out.println("不存在該節(jié)點(diǎn)！");
 }
 }
 //刪除節(jié)點(diǎn)
 public void del(int no) {
 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 == no) {
 flag = true;
 break;
 }
 temp = temp.next;
 }
 if(flag) {
 temp.next = temp.next.next;
 }else {
 System.out.println("該節(jié)點(diǎn)不存在！");
 }
 }
 public void list() {
 HeroNode temp = head;
 if(temp.next == null) {
 System.out.println("鏈表為空！");
 return;
 }
 while(true) {
 if(temp.next == null) {
 break;
 }
 System.out.println(temp.next);
 temp = temp.next; 
 }
 }
}
class HeroNode{
 public int no;//英雄編號(hào)
 public String name;//人名
 public String nickname;//綽號(hào)
 public HeroNode next;//下一個(gè)節(jié)點(diǎn)
 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 + "]";
 }
 
 
 
}