1. Data structure and algorithm:
Step 1) Create HeroNode singly linked list class:
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 + '\'' +
//", next=" + next +
'}';
}
}
Step 2) Create a singly linked list header:
class SingleLinkedList {
private HeroNode head = new HeroNode(0, "", "");
public HeroNode getHead() {
return head;
}
public void setHead(HeroNode head) {
this.head = head;
}
}
Step 3) New add method to add linked list elements:
public void add(HeroNode heroNode){
HeroNode temp = head;
while(true){
if(temp.next == null){
break;
}
if(heroNode.no < temp.next.no){
heroNode.next = temp.next;
temp.next = heroNode;
return;
}else if(heroNode.no == temp.next.no) {
System.out.println("已经存在，无法添加！");
return;
}
temp = temp.next;
}
temp.next = heroNode;
}
Step 4) New list method to traverse the elements of the linked list:
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+"\r\n");
temp = temp.next;
}
System.out.println();
}
Step 5) New updata method to update linked list elements:
public void updata(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 == true){
temp.name = newHeroNode.name;
temp.nickName = newHeroNode.nickName;
}else{
System.out.println("没有找到需要修改的编号");
}
}
Step 6) New del method to delete linked list elements:
public void del(int no){
HeroNode temp = head;
if(head.next == null){
System.out.println("链表为空");
return;
}
boolean flag = false;
while (true){
if(temp.next == null){
break;
}
if(temp.next.no == no){
flag = true;
break;
}
temp = temp.next;
}
if(flag == true){
temp.next = temp.next.next;
}else{
System.out.println("没有找到需要删除的编号");
}
}
Step 7) main method:
public static void main(String[] args) {
HeroNode heroNode1 = new HeroNode(1, "宋江", "及时雨");
HeroNode heroNode2 = new HeroNode(2, "瑞军", "王启林");
HeroNode heroNode3 = new HeroNode(3, "无用", "之多新");
HeroNode heroNode4 = new HeroNode(4, "林冲", "豹子头");
SingleLinkedList singleLinkedList = new SingleLinkedList();
singleLinkedList.add(heroNode1);
singleLinkedList.add(heroNode4);
singleLinkedList.add(heroNode3);
singleLinkedList.add(heroNode2);
System.out.println("遍历链表");
singleLinkedList.list();
}
• Written by ChiKong_Tam on September 6, 2020