修改节点内容,根据排名no来确定待修改的节点,但不修改排名no。
一、代码
public class SingleLinkedListDemo {
public static void main(String[] args) {
System.out.println("开始测试... ... ... ... ...");
HeroNode hero1 = new HeroNode(1, "宋江", "及时雨");
HeroNode hero2 = new HeroNode(2, "卢俊义", "玉麒麟");
HeroNode hero3 = new HeroNode(3, "吴用", "智多星");
HeroNode hero4 = new HeroNode(4, "公孙胜", "入云龙");
HeroNode hero5 = new HeroNode(5, "关胜", "大刀");
SingleLinkedList singlelinkedlist1 = new SingleLinkedList();
singlelinkedlist1.add(hero1);
singlelinkedlist1.add(hero3);
singlelinkedlist1.add(hero2);
singlelinkedlist1.add(hero4);
singlelinkedlist1.add(hero5);
System.out.println("修改之前的链表:");
singlelinkedlist1.list();
HeroNode hero6 = new HeroNode(3, "小吴", "智多星~~");
singlelinkedlist1.updata(hero6);
System.out.println("修改之后的链表:");
singlelinkedlist1.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.next == null) {
break;
}
if(temp.next.no > heroNode.no) {
break;
}
else 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 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;
}
}
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) {
temp.name = newHeroNode.name;
temp.nickname = newHeroNode.nickname;
}else {
System.out.printf("没有找到排名为%d的英雄\n", newHeroNode.no);
}
}
}
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 + ", 姓名 = " + name + ", 绰号 = " + nickname + "]";
}
}
二、结果
开始测试... ... ... ... ...
修改之前的链表:
HeroNode [排名 = 1, 姓名 = 宋江, 绰号 = 及时雨]
HeroNode [排名 = 3, 姓名 = 吴用, 绰号 = 智多星]
HeroNode [排名 = 2, 姓名 = 卢俊义, 绰号 = 玉麒麟]
HeroNode [排名 = 4, 姓名 = 公孙胜, 绰号 = 入云龙]
HeroNode [排名 = 5, 姓名 = 关胜, 绰号 = 大刀]
修改之后的链表:
HeroNode [排名 = 1, 姓名 = 宋江, 绰号 = 及时雨]
HeroNode [排名 = 3, 姓名 = 小吴, 绰号 = 智多星~~]
HeroNode [排名 = 2, 姓名 = 卢俊义, 绰号 = 玉麒麟]
HeroNode [排名 = 4, 姓名 = 公孙胜, 绰号 = 入云龙]
HeroNode [排名 = 5, 姓名 = 关胜, 绰号 = 大刀]