day02-创建一个单链表
package aStudy.day2;
import sun.font.EAttribute;
import javax.sql.rowset.CachedRowSet;
import java.io.PrintWriter;
import java.time.temporal.Temporal;
import java.util.TreeMap;
public class data01 {
public static void main(String[] args) {
HeroNode hero1 = new HeroNode(1,"haoqi","black");
HeroNode hero2 = new HeroNode(2,"xuxuchao","shouzi");
HeroNode hero3 = new HeroNode(3,"dapeng","pangzi");
HeroNode hero4 = new HeroNode(4,"saifei","liuzi");
SingleLinkedList singleLinkedList = new SingleLinkedList();
singleLinkedList.addOrder(hero1);
singleLinkedList.addOrder(hero4);
singleLinkedList.addOrder(hero2);
singleLinkedList.addOrder(hero3);
singleLinkedList.list();
System.out.println("\n==============\n");
HeroNode newHeroNode = new HeroNode(2,"wuzhen","xiaohai");
singleLinkedList.update(newHeroNode);
singleLinkedList.list();
System.out.println("\n==============\n");
singleLinkedList.deldet(1);
singleLinkedList.deldet(4);
singleLinkedList.list();
}
}
class HeroNode{
public int no;
public String name;
public String niloName;
public HeroNode next;
public HeroNode(int no, String name, String niloName) {
this.no = no;
this.name = name;
this.niloName = niloName;
}
@Override
public String toString() {
return "LinkList{" +
"no=" + no +
", name='" + name + '\'' +
", niloName='" + niloName + '\'' +
'}';
}
}
class SingleLinkedList{
private HeroNode head = new HeroNode(0,"","");
public HeroNode getHead(){
return head;
}
public void add(HeroNode heroNode){
HeroNode temp = head;
while (true){
if (temp.next == null) break;
temp = temp.next;
}
temp.next = heroNode;
}
public void addOrder(HeroNode heroNode) {
HeroNode temp = head;
boolean flag = false;
while (true) {
if (temp.next == null) break;
if (temp.next.no > heroNode.no) break;
if (temp.next.no == heroNode.no) {
flag = true;
break;
}
temp = temp.next;
}
if (flag){
System.out.printf("要添加的编号 %d 已经存在,不能加入\n",heroNode.no);
} else {
heroNode.next = temp.next;
temp.next = heroNode;
}
}
public void update(HeroNode newHeroNode){
if (head.next == null){
System.out.println("链表为空");
return;
}
HeroNode temp = head.next;
boolean flag = false;
while (true){
if (temp == null) break;
if (temp.no == newHeroNode.no){
flag = true;
break;
}
temp = temp.next;
}
if (flag){
temp.name = newHeroNode.name;
temp.niloName = newHeroNode.niloName;
} else System.out.printf("没有找到编号 %d 的节点,无法修改",newHeroNode.no);
}
public void deldet(int no){
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.printf("delete error %d\n",no);
}
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;
}
}
}