/*
数据结构与算法
Cấu trúc dữ liệu và thuật toán
データ構造とアルゴリズム
데이터 구조 및 알고리즘
*/
package yanhaochen;
public class hello{
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,"林冲","豹子头");
//加入
SingleLinkedList singleLinkedList = new SingleLinkedList();
singleLinkedList.add(hero1);
singleLinkedList.add(hero2);
singleLinkedList.add(hero3);
singleLinkedList.add(hero4);
//显示
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 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;
}
}
}
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 + '\'' +
'}';
}
}
南风暖栀
发布了6 篇原创文章 · 获赞 3 · 访问量 1711
私信
关注
标签:单链,Java,String,temp,HeroNode,next,遍历,nickname,public
来源: https://blog.csdn.net/weixin_45113423/article/details/104511893