主函数测试代码:
public static void main(String[] args){
Scanner scanner=new Scanner(System.in);
//先创建节点
HeroNode hero1=new HeroNode(1,"宋江","及时雨");
HeroNode hero2=new HeroNode(2,"卢俊义","玉麒麟");
HeroNode hero3=new HeroNode(4,"吴用","智多星");
HeroNode hero4=new HeroNode(7,"林冲","豹子头");
//创建要给链表
DoubleLinkedList DoubleLinkedList=new DoubleLinkedList();
//1.添加数据
DoubleLinkedList.add(hero1);
DoubleLinkedList.add(hero2);
DoubleLinkedList.add(hero3);
DoubleLinkedList.add(hero4);
//2.显示数据
DoubleLinkedList.list(DoubleLinkedList.getHead());
//3.按照顺序插入节点
HeroNode hero5=new HeroNode(0,"张三","小张");
DoubleLinkedList.orderAdd(hero5);
System.out.println("按照顺序添加数据后的链表为:");
DoubleLinkedList.list(DoubleLinkedList.getHead());
//4.删除节点
DoubleLinkedList.deleteNode(0);
DoubleLinkedList.list(DoubleLinkedList.getHead());
//5.修改节点
HeroNode node=new HeroNode(7,"花花","小花");
DoubleLinkedList.updateNode(node);
DoubleLinkedList.list(DoubleLinkedList.getHead());
}
双向链表类:
//定义DoubleLinkedList管理我们的英雄
class DoubleLinkedList{
//先初始化一个头节点,头节点不能动,不存放具体的数据
private HeroNode head=new HeroNode(0,"","");
public HeroNode getHead() {
return head;
}
public void setHead(HeroNode head) {
this.head = head;
}
//修改某个节点
public void updateNode(HeroNode node){
HeroNode temp=head.next;
while(true){
if(temp==null){
System.out.println("您要修改的节点不存在");
break;
}
if(temp.no==node.no){
temp.name=node.name;
temp.nickname=node.nickname;
System.out.println("修改成功");
break;
}
temp=temp.next;
}
}
//显示双链表
public void list(HeroNode head){
HeroNode temp=head.next;
if(head.next==null) System.out.println("链表为空");
while(true){
if(temp==null){
break;
}
System.out.println(temp);
temp=temp.next;
}
}
//尾部添加数据
public void add(HeroNode heroNode){
HeroNode temp = head;
while (temp.next!=null){
temp=temp.next;
}
temp.next=heroNode;
heroNode.pre=temp;
}
//按照顺序插入节点
public void orderAdd(HeroNode heroNode){
HeroNode temp=head;
boolean flag=false;
while (true){
if(temp.next==null){
temp.next=heroNode;
heroNode.pre=temp;
break;
}
if(temp.next.no>heroNode.no){
temp.next.pre=heroNode;
heroNode.next=temp.next;
heroNode.pre=temp;
temp.next=heroNode;
return;
}
temp=temp.next;
}
}
//删除节点
public void deleteNode(int no){
HeroNode temp=head.next;
while(true){
if (temp==null){
System.out.println("不存在您要删除的节点");
break;
}
if (temp.no==no&&temp.next!=null){
temp.next.pre=temp.pre;
temp.pre.next=temp.next;
System.out.println("删除成功!");
break;
}
if (temp.no==no){
temp.pre.next=null;
System.out.println("删除成功!");
break;
}
temp=temp.next;
}
}
}
英雄类:
//定义HeroNode,每个HeroNode对象就是一个节点
class HeroNode{
public HeroNode pre;
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;
}
//为了显示方法,我们重新toString
@Override
public String toString() {
return "HeroNode{" +
"no=" + no +
", name='" + name + '\'' +
", nickname='" + nickname +
"'}";
}
}
效果图: