1、链表是以节点的方式来储存,是链式储存
2、每个节点包含data域,next域(指向下一个节点)
3、单链表带头节点
应用实例:使用带head的单向链表实现增删改查操作
首先定义一个HeroNode类,每个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 + '\'' +
'}';
}
}
初始化头结点
private HeroNode head = new HeroNode(0,"","");
完成添加人物时按排名no来插入指定位置的操作,其中借用temp指针来辅助遍历。
public void addByOrder(HeroNode heroNode){
HeroNode temp = head;
boolean flag = false;
while (true){
if (temp.next == null){
break; //temp已经在链表的最后
}
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已经存在了,不能加入",heroNode.no);
}else {
heroNode.next = temp.next;
temp.next = heroNode;
}
}
完成根据no编号来修改节点的信息功能(与添加类似)
public void update(HeroNode heroNode){
HeroNode temp = head.next;
if (temp == null){
System.out.println("链表为空");
return;
}
boolean flag = false;
while (true){
if (temp.no == heroNode.no){
flag = true;
break;
}
temp = temp.next;
}
if (flag){
temp.name = heroNode.name;
temp.nickname = heroNode.nickname;
}else {
System.out.println("找不到此编号");
}
}
删除节点则是先找到删除的节点的前一个节点,把其next域直接指向要删除节点的后一个节点;要删除的节点失去了引用,会被GC清理。
public void delete(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.println("要删除的节点不存在");
}
}
最后是简单的遍历链表操作
public void list(){
HeroNode temp = head.next;
while (true){
if (temp == null){
break;
}
System.out.println(temp);
temp = temp.next;
}
}
所有功能完成后我们来实现一把
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,"小绿","绿巨人");
HeroNode hero5 = new HeroNode(4,"小青","青蛇");
SingleLinkedList singleLinkedList = new SingleLinkedList();
singleLinkedList.addByOrder(hero1);
singleLinkedList.addByOrder(hero4);
singleLinkedList.addByOrder(hero3);
singleLinkedList.addByOrder(hero2);
//遍历一遍
System.out.println("修改前");
singleLinkedList.list();
singleLinkedList.delete(1);
System.out.println("删除后");
//遍历一遍
singleLinkedList.list();
singleLinkedList.update(hero5);
System.out.println("更新后");
//遍历一遍
singleLinkedList.list();
}
结果显示: