单链表
视频学习地址:https://www.bilibili.com/video/BV1E4411H73v?p=16
链表中的数据是以结点来表示的,其通过每个结点的链域将线性表的n个结点按其逻辑顺序链接在一起的,每个结点只有一个链域的链表称为单链表。
在内存中存储方式示意图:
特点:
- 链表是以节点的方式来存储
- 每个节点包含data域,next域(指向下一个节点)
- 链表各个节点不一定是连续存储的
- 链表分带头节点的链表和没有头节点的链表,需要根据实际需求确定
单链表结构示意图:
实例:
实体类:单链表中每个节点就是这个类的一个对象
class HeroNode{
int no;
String name;
String nickName;
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 + '\'' +
'}';
}
}
SingleLinkedList管理链表的类,用来实现具体功能:
1.添加节点
1.1 思路:
- 通过temp辅助变量,找到当前链表的最后节点
- 将最后节点的next 指向新的节点
/**
* 管理链表的类
*/
class SingleLinkedList{
//定义头节点
private HeroNode head = new HeroNode(0,"","");
public HeroNode getHead(){
return this.head;
}
/**
* 添加节点
* @param heroNode
*/
public void add(HeroNode heroNode){
HeroNode temp = head;
//while循环找到最后的节点
while(true){
if(temp.next == null){
break;
}
temp = temp.next;
}
temp.next = heroNode;
}
}
1.2测试用例:
public class SingleLinkedListDemo {
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 list = new SingleLinkedList();
list.add(hero1);
list.add(hero2);
list.add(hero3);
list.add(hero4);
list.list();
}
}
1.3测试结果:
2. 遍历链表
2.1 思路:
- 判断链表是否为空
- 通过temp辅助变量进行遍历
/**
* 管理链表的类
*/
class SingleLinkedList{
//定义头节点
private HeroNode head = new HeroNode(0,"","");
public HeroNode getHead(){
return this.head;
}
/**
* 显示链表(遍历)
*/
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;
}
}
}
2.2测试用例:
同上
2.3测试结果:
同上
3. 根据no,修改节点信息
3.1 思路:
- 遍历链表
- 找到与heroNode的no值相同的节点
- 修改对应信息
/**
* 管理链表的类
*/
class SingleLinkedList{
//定义头节点
private HeroNode head = new HeroNode(0,"","");
public HeroNode getHead(){
return this.head;
}
/**
*根据no,修改节点信息
* @param heroNode
*/
public void update(HeroNode heroNode){
if(head.next == null){
System.out.println("该链表为空~");
return;
}
HeroNode temp = head.next;
boolean flag = false;
//遍历链表,找到与heroNode的no值相同的节点
while (true){
if(temp == null){
break;
}
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("未找到对应的节点~");
}
}
}
3.2测试用例:
public class SingleLinkedListDemo {
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(1,"小宋","及时雨");
SingleLinkedList list = new SingleLinkedList();
list.add(hero1);
list.add(hero2);
list.add(hero3);
list.add(hero4);
System.out.println("修改之前~~~");
list.list();
System.out.println("修改之后~~~");
list.update(hero5);
list.list();
}
}
3.3测试结果:
4. 删除节点
4.1 思路:
- 遍历链表
- 找到要删除的节点的前一个节点
- 此时temp指向待删节点的前一个节点
- 将temp.next 指向 temp.next.next
/**
* 管理链表的类
*/
class SingleLinkedList{
//定义头节点
private HeroNode head = new HeroNode(0,"","");
public HeroNode getHead(){
return this.head;
}
/**
* 删除节点
* @param no
*/
public void del(int no){
if(head.next == null){
System.out.println("该链表为空~");
return;
}
HeroNode temp = head;
boolean flag = false;
while (true){
if(temp == null){//遍历到最后节点
break;
}
if(temp.next.no == no){
flag = true;
break;
}
temp = temp.next;
}
if(flag){
temp.next = temp.next.next;
}else {
System.out.println("未找到要删除的节点~");
}
}
}
4.2测试用例:
public class SingleLinkedListDemo {
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 list = new SingleLinkedList();
list.add(hero1);
list.add(hero2);
list.add(hero3);
list.add(hero4);
System.out.println("删除之前~~~");
list.list();
System.out.println("删除之后~~~");
list.del(1);
list.list();
}
}
4.3测试结果:
5. 根据no的大小,顺序插入
5.1思路:
- 通过temp临时变量,找到新增节点的正确位置
- 新的节点的next 指向 temp.next
- temp.next 指向新的节点
/**
* 通过no顺序排列
* @param heroNode
*/
public void addByOrder(HeroNode heroNode){
HeroNode temp = head;
boolean flag = false;
while (true){
/**
* 表示两种情况
* 1、当链表无节点时,直接跳出循环
* 2、当链表循环到最后时,跳出循环
*/
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.println("该节点已经存在~");
}else{
heroNode.next = temp.next;
temp.next = heroNode;
}
}
5.2测试用例:
public class SingleLinkedListDemo {
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 list = new SingleLinkedList();
list.addByOrder(hero2);
list.addByOrder(hero4);
list.addByOrder(hero1);
list.addByOrder(hero3);
list.list();
}
}