1.链表
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/f7e7643f8e296dce3c96e33666567730.png)
2.单链表的应用实例
![在.里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/7440a2ddbeab9bd670c5e4585e0c8c76.png)
3.单链表的创建
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/2a615fa18507bfe0646bc5f6a7ded9a3.png)
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(hero2);
singleLinkedList.add(hero3);
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 +"]";
}
}
4.单链表的修改
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/79e142ccdb2a0365e998c2488cb40913.png)
1.
public void update(HeroNode newHeroNode) {
if (head.next == null) {
System.out.println("链表为空:");
return;
}
HeroNode temp = head.next;
boolean flag = false;
while (true) {
if (temp == 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 的节点,不能修改\n",newHeroNode.no);
}
}
2.
HeroNode newHeroNode = new HeroNode(2,"小路", "小龙人");
singleLinkedList.update(newHeroNode);
System.out.println("修改后的链表情况:");
singleLinkedList.list();
3.
效果:
HeroNode [no=1, name=松江, nickname=及时雨]
HeroNode [no=2, name=卢俊义, nickname=玉麒麟]
HeroNode [no=3, name=吴用, nickname=豹子头]
修改后的链表情况:
HeroNode [no=1, name=松江, nickname=及时雨]
HeroNode [no=2, name=小路, nickname=小龙人]
HeroNode [no=3, name=吴用, nickname=豹子头]
5.单链表的删除
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/0627e188a20ef8fa0535702590fdc793.png)
1.
public void del(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 节点,删除失败\n",no);
}
}
2.
System.out.println("原链表:");
singleLinkedList.list();
singleLinkedList.del(1);
System.out.println("删除后的链表情况:");
singleLinkedList.list();
singleLinkedList.del(4);
System.out.println("删除后的链表情况:");
singleLinkedList.list();
singleLinkedList.del(2);
System.out.println("删除后的链表情况:");
singleLinkedList.list();
singleLinkedList.del(3);
System.out.println("删除后的链表情况:");
singleLinkedList.list();
3.
效果:
原链表:
HeroNode [no=1, name=松江, nickname=及时雨]
HeroNode [no=2, name=小路, nickname=小龙人]
HeroNode [no=3, name=吴用, nickname=豹子头]
删除后的链表情况:
HeroNode [no=2, name=小路, nickname=小龙人]
HeroNode [no=3, name=吴用, nickname=豹子头]
没有找到要删除的 4 节点,删除失败
删除后的链表情况:
HeroNode [no=2, name=小路, nickname=小龙人]
HeroNode [no=3, name=吴用, nickname=豹子头]
删除后的链表情况:
HeroNode [no=3, name=吴用, nickname=豹子头]
删除后的链表情况:
链表为空
6.完整功能的单链表代码
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(hero2);
singleLinkedList.add(hero3);
singleLinkedList.list();
HeroNode newHeroNode = new HeroNode(2,"小路", "小龙人");
singleLinkedList.update(newHeroNode);
System.out.println("修改后的链表情况:");
singleLinkedList.list();
System.out.println("原链表:");
singleLinkedList.list();
singleLinkedList.del(1);
System.out.println("删除后的链表情况:");
singleLinkedList.list();
singleLinkedList.del(4);
System.out.println("删除后的链表情况:");
singleLinkedList.list();
singleLinkedList.del(2);
System.out.println("删除后的链表情况:");
singleLinkedList.list();
singleLinkedList.del(3);
System.out.println("删除后的链表情况:");
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 update(HeroNode newHeroNode) {
if (head.next == null) {
System.out.println("链表为空:");
return;
}
HeroNode temp = head.next;
boolean flag = false;
while (true) {
if (temp == 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 的节点,不能修改\n",newHeroNode.no);
}
}
public void del(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 节点,删除失败\n",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;
}
}
}
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 +"]";
}
}