public class SingleLinkedListDemo {
public static void main(String[] args) {
HeroNode node1 = new HeroNode(1,"test1","test11");
HeroNode node2 = new HeroNode(2,"test2","test22");
HeroNode node3 = new HeroNode(3,"test3","test33");
HeroNode node4 = new HeroNode(4,"test4","test44");
HeroNode node5 = new HeroNode(5,"test5","test55");
SingleLinkedList singleLinkedList = new SingleLinkedList();
// singleLinkedList.add(node1);
// singleLinkedList.add(node2);
// singleLinkedList.add(node3);
// singleLinkedList.add(node5);
// singleLinkedList.list();
singleLinkedList.addByOrder(node1);
singleLinkedList.addByOrder(node3);
singleLinkedList.addByOrder(node2);
singleLinkedList.addByOrder(node5);
singleLinkedList.addByOrder(node4);
singleLinkedList.list();
}
}
//创建SingleLinkedList管理英雄
class SingleLinkedList{
//初始化一个头节点,头节点不要动,不存放具体数据
private HeroNode head = new HeroNode(0,"","");
//不带排序
//初始化头节点,只要是temp.next为空就插入
public void add(HeroNode heroNode){
HeroNode temp = head;
while (true){
if(temp.next == null){
break;
}
//temp.next不为空,移到下一位
temp = temp.next;
}
temp.next = heroNode;
}
public void addByOrder(HeroNode heroNode){
HeroNode temp = head;
boolean flag = false;
while (true){
if(temp.next == null){
break;
}
//判断temp.next元素的编号是否大于要插入数据heroNode的no 如果大于说明插入位置为temp.next
if(temp.next.no > heroNode.no){
break;
}else if (temp.next.no == heroNode.no){
flag = true;
}
temp = temp.next;
}
//flag为true说明已存在此节点
if(flag){
System.out.println("已经存在此节点,不能重复加入!");
}else {
/*
先把temp.next赋值给heroNode.next 分两种情况 如果temp.next == null 则默认插入到最后。
如果temp.next.no > heroNode.no 说明待插入值的编号小于下一个值的编号
先把下一个值指向待插入值的.next 再把temp.next指向待插入值
*/
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;
}
}
}
//每个HeroNode都是一个节点
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 + '\''+"}";
}
}
Java 实现带头节点的单链表
最新推荐文章于 2023-02-27 09:32:13 发布