目录
创建节点:
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 + '\'' +
'}';
}
}
以人物排名添加节点:
public void add(HeroNode heroNode) {
//因为头结点不能动,则添加一个temp的节点作为指针,所添加的值为temp的后一个节点
HeroNode temp = head;
boolean flag = false;//标记添加的编号不存在,可以添加,默认为false
while (true){
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.printf("准备添加的英雄编号%d已经存在,不能添加\n",heroNode.no);
}else{
//添加的两种情况,1.添加到链表的末尾,2.插入temp之后
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;
}
}
修改链表:
//根据排名,进行链表修改
public void updata(HeroNode newHeroNode){
if (head.next == null){
System.out.println("链表为空");
return;
}
//根据no号修改改节点
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相同的节点",newHeroNode.no);
}
}
删除节点:
public void del(int no){
HeroNode temp = head;
boolean flag = false;//标志是否找到待删除的节点
while (true){
if (temp.next==null){
System.out.println("没有节点必须退出");
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 static int getLength(HeroNode head){
if (head.next==null){
return 0;
}
int length = 0;
//定义一个辅助变量
HeroNode cur = head.next;
while (cur!=null){
length++;
cur = cur.next;
}
return length;
}
查找链表中倒数第n个节点:
public static HeroNode findLastIndeexNode(HeroNode head,int index){
if(head.next==null){
return null;
}
int size = getLength(head);
if (size<=0||index>size){
return null;
}
HeroNode cur = head.next;
for (int i = 0; i < size-index; i++) {
cur = cur.next;
}
return cur;
}
翻转链表,破坏了链表结构:
public static void reverSetList(HeroNode head){
if (head.next==null||head.next.next==null){
return;
}
HeroNode reversetHead = new HeroNode(0,"","");
HeroNode cur = head.next;
HeroNode next = null;
while (cur!=null){
next = cur.next;
cur.next = reversetHead.next;
reversetHead.next = cur;
cur=next;
}
head.next = reversetHead.next;
}
以栈的方式从尾到头打印链表,不破坏链表结构:
public static void reversePrint(HeroNode head){
if (head.next==null){
return;
}
//创建一个栈,将各个节点压入栈
Stack<HeroNode> stack = new Stack<HeroNode>();
HeroNode cur = head.next;
//将链表的所有节点压入栈
while (cur!=null){
stack.push(cur);
cur = cur.next;
}
//将栈中的所有节点进行打印。pop出栈;
while (stack.size()>0){
System.out.println(stack.pop());
}
}
最后运行代码:
import java.util.Stack;
//在添加时,自动排序链表
//按顺序插入节点,再添加 根据排名,进行修改的方法
//单链表的删除,根据排名删除列表
public class PaiMingDianLianBiao {
public static void main(String[] args) {
HeroNode h1 = new HeroNode(1,"宋江","及时雨");
HeroNode h2 = new HeroNode(2,"卢俊义","玉麒麟");
HeroNode h3 = new HeroNode(3,"吴用","智多星");
HeroNode h4 = new HeroNode(4,"林冲","豹子头");
SingleLinkedList2 singleLinkedList = new SingleLinkedList2();
singleLinkedList.add(h1);
singleLinkedList.add(h3);
singleLinkedList.add(h2);
singleLinkedList.add(h4);
singleLinkedList.list();
System.out.println("============修改后的链表=============");
HeroNode h5 = new HeroNode(2,"小卢","麒麟");
singleLinkedList.updata(h5);
singleLinkedList.list();
singleLinkedList.del(1);
System.out.println("=============删除后的链表==========");
singleLinkedList.list();
System.out.print("链表有效长度");
System.out.println(getLength(singleLinkedList.head));
System.out.println("查找链表倒数第一个节点");
System.out.println(findLastIndeexNode(singleLinkedList.head, 1));
System.out.println("============翻转链表,破坏了链表结构========");
reverSetList(singleLinkedList.head);
singleLinkedList.list();
System.out.println("==========栈翻转打印链表========");
reversePrint(singleLinkedList.head);
}
//求链表中有效节点的个数
public static int getLength(HeroNode head){
if (head.next==null){
return 0;
}
int length = 0;
//定义一个辅助变量
HeroNode cur = head.next;
while (cur!=null){
length++;
cur = cur.next;
}
return length;
}
//查找链表中倒数第n个节点
public static HeroNode findLastIndeexNode(HeroNode head,int index){
if(head.next==null){
return null;
}
int size = getLength(head);
if (size<=0||index>size){
return null;
}
HeroNode cur = head.next;
for (int i = 0; i < size-index; i++) {
cur = cur.next;
}
return cur;
}
//翻转链表,破坏了链表结构
public static void reverSetList(HeroNode head){
if (head.next==null||head.next.next==null){
return;
}
HeroNode reversetHead = new HeroNode(0,"","");
HeroNode cur = head.next;
HeroNode next = null;
while (cur!=null){
next = cur.next;
cur.next = reversetHead.next;
reversetHead.next = cur;
cur=next;
}
head.next = reversetHead.next;
}
//以栈的方式从尾到头打印链表,不破坏链表结构
public static void reversePrint(HeroNode head){
if (head.next==null){
return;
}
//创建一个栈,将各个节点压入栈
Stack<HeroNode> stack = new Stack<HeroNode>();
HeroNode cur = head.next;
//将链表的所有节点压入栈
while (cur!=null){
stack.push(cur);
cur = cur.next;
}
//将栈中的所有节点进行打印。pop出栈;
while (stack.size()>0){
System.out.println(stack.pop());
}
}
}
class SingleLinkedList2 {
HeroNode head = new HeroNode(0, "", "");
public void add(HeroNode heroNode) {
//因为头结点不能动,则添加一个temp的节点作为指针,所添加的值为temp的后一个节点
HeroNode temp = head;
boolean flag = false;//标记添加的编号不存在,可以添加,默认为false
while (true){
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.printf("准备添加的英雄编号%d已经存在,不能添加\n",heroNode.no);
}else{
//添加的两种情况,1.添加到链表的末尾,2.插入temp之后
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;
}
}
//根据排名,进行链表修改
public void updata(HeroNode newHeroNode){
if (head.next == null){
System.out.println("链表为空");
return;
}
//根据no号修改改节点
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相同的节点",newHeroNode.no);
}
}
public void del(int no){
HeroNode temp = head;
boolean flag = false;//标志是否找到待删除的节点
while (true){
if (temp.next==null){
System.out.println("没有节点必须退出");
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);
}
}
}
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 + '\'' +
'}';
}
}
运行结果:
HeroNode{no=1, name='宋江', nickName='及时雨'}
HeroNode{no=2, name='卢俊义', nickName='玉麒麟'}
HeroNode{no=3, name='吴用', nickName='智多星'}
HeroNode{no=4, name='林冲', nickName='豹子头'}
============修改后的链表=============
HeroNode{no=1, name='宋江', nickName='及时雨'}
HeroNode{no=2, name='小卢', nickName='麒麟'}
HeroNode{no=3, name='吴用', nickName='智多星'}
HeroNode{no=4, name='林冲', nickName='豹子头'}
=============删除后的链表==========
HeroNode{no=2, name='小卢', nickName='麒麟'}
HeroNode{no=3, name='吴用', nickName='智多星'}
HeroNode{no=4, name='林冲', nickName='豹子头'}
链表有效长度3
查找链表倒数第一个节点
HeroNode{no=4, name='林冲', nickName='豹子头'}
============翻转链表,破坏了链表结构========
HeroNode{no=4, name='林冲', nickName='豹子头'}
HeroNode{no=3, name='吴用', nickName='智多星'}
HeroNode{no=2, name='小卢', nickName='麒麟'}
==========栈翻转打印链表========
HeroNode{no=2, name='小卢', nickName='麒麟'}
HeroNode{no=3, name='吴用', nickName='智多星'}
HeroNode{no=4, name='林冲', nickName='豹子头'}