主要实现了单链表的增删改查操作
图解分析:
1、增:(按照添加顺序增加)
2、自动按照编号排序增加
3、修改以及删除:
代码实现:
1、定义一个英雄节点,加入英雄的属性,其中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 + '\'' +
'}';
}
}
2、单链表增删改查主体部分:
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;
}
//退出while循环之后,temp已经指向了链表的最后
temp.next = heroNode;//让temp的下一个指向加入的这个节点
}
//加进来的人按照no顺序排列
public void addByOrder(HeroNode heroNode){
//head头节点不能改变,加入辅助变量temp
HeroNode temp = head;
boolean flag = false;//定义指示变量
while(true){
if (temp.next == null){
break;//说明节点已经到最后了
}
if (temp.next.no>heroNode.no){//位置找到,就在temp后面加就行
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;
}
}
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.printf("要删除的编号为%d的英雄节点不存在",no);
}
}
//修改英雄信息
public void update(HeroNode newHeroNode){
//先判断链表是否为空
if (head.next == null){
System.out.println("链表为空");
}
HeroNode temp = head.next;
boolean flag = false;
while(true){
if(temp.next == 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的英雄找不到",newHeroNode.no);
}
}
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;
}
}
}
3、测试部分:
package LinkedList.SingleLinkedList;
/**
* 单链表案例练习:
* @author:mg
*/
public class SingleLinkedListDemo {
public static void main(String[] args) {
//测试
HeroNode hero1 = new HeroNode(1,"宋江","及时雨");
HeroNode hero2 = new HeroNode(2,"林冲","豹子头");
HeroNode hero3 = new HeroNode(3,"吴用","智多星");
SingleLinkedList singleLinkedList = new SingleLinkedList();
/*singleLinkedList.add(hero1);
singleLinkedList.add(hero3);
singleLinkedList.add(hero2);*/
singleLinkedList.addByOrder(hero1);
singleLinkedList.addByOrder(hero3);
singleLinkedList.addByOrder(hero2);
singleLinkedList.list();
System.out.println("-----------------------");
// singleLinkedList.update(new HeroNode(1,"小宋","及时雨~~"));
singleLinkedList.delete(1);
singleLinkedList.delete(2);
singleLinkedList.delete(3);
singleLinkedList.list();
}
}