代码如下:
public class DoubleLinkedListDemo {
public static void main(String[] args) {
//测试
HeroNode2 node1 = new HeroNode2(1, "宋江", "及时雨");
HeroNode2 node2 = new HeroNode2(2, "卢俊义", "玉麒麟");
HeroNode2 node3 = new HeroNode2(3, "吴用", "智多星");
HeroNode2 node4 = new HeroNode2(4, "林冲", "豹子头");
DoubleLinkedList doubleLinkedList = new DoubleLinkedList();
//普通添加方法
// doubleLinkedList.add(node1);
// doubleLinkedList.add(node2);
// doubleLinkedList.add(node3);
// doubleLinkedList.add(node4);
//顺序添加
doubleLinkedList.addByOrder(node2);
doubleLinkedList.addByOrder(node1);
doubleLinkedList.addByOrder(node3);
doubleLinkedList.addByOrder(node4);
System.out.println("修改前");
doubleLinkedList.listNode();
doubleLinkedList.update(new HeroNode2(1,"李逵","黑旋风"));
System.out.println("修改后");
doubleLinkedList.listNode();
}
}
class DoubleLinkedList {
//初始化一个头节点,不存放具体数据,只指向表头
private HeroNode2 head = new HeroNode2(0, "", "");
public HeroNode2 getHead() {
return head;
}
//遍历双向链表
public void listNode() {
//判断链表是否为空
if (head.next == null) {
System.out.println("链表为空!");
return;
}
//定义临时变量辅助遍历
//前边已经判断过是否为空,所以到这里,至少有一个元素
HeroNode2 temp = head.next;
while (true) {
//判断是否到链表最后
if (temp == null) {
break;
}
//输出节点信息,指针后移
System.out.println(temp.toString());
temp = temp.next;
}
}
//添加
public void add(HeroNode2 heroNode) {
//因为头节点不能动,所以需要一个辅助变量来遍历
HeroNode2 temp = head;
//遍历链表,找到最后的节点
while (true) {
if (temp.next == null) {
break;
}
//如果没到最后就修改指针,指向下一个节点
temp = temp.next;
}
//当退出循环时,说明到了链表的最后节点
//将最后节点的next域修改为要插入的节点即可
temp.next = heroNode;
heroNode.pre = temp;
}
//按照编号顺序添加
public void addByOrder(HeroNode2 heroNode){
HeroNode2 temp = head;
boolean flag = 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.println("要插入的节点已经存在");
}else{
if (temp.next != null){ //这里要小心,如果要插入的元素在最后,只用修改两个指针即可
temp.next.pre = heroNode;
heroNode.next = temp.next;
}
temp.next = heroNode;
heroNode.pre = temp;
}
}
//修改节点
public void update(HeroNode2 newHeroNode) {
if (head.next == null) {
System.out.println("链表为空!");
return;
}
//遍历寻找
HeroNode2 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.println("没有找到编号为" + newHeroNode.no + "的节点,不能修改");
}
}
//删除节点
//可以直接找到要删除的节点,自我删除
public void delete(int no) {
//判断当前链表是否为空
if (head.next == null){
System.out.println("当前链表为空!");
return;
}
HeroNode2 temp = head.next;
boolean flag = false; //表示是否找到
while (true) {
if (temp == null) {
break; //已经遍历到最后一个节点
}
if (temp.no == no) {
flag = true;
break;
}
temp = temp.next; //此轮没找到,进行下一轮遍历
}
if (flag) {
temp.pre.next = temp.next;
if (temp.next != null){
temp.next.pre = temp.pre;
}
} else {
System.out.println("要删除的节点不存在" + no);
}
}
}
class HeroNode2 {
public int no;
public String name;
public String nickname;
public HeroNode2 next; //指向下一个节点,默认为null
public HeroNode2 pre;
public HeroNode2(int hNo, String hName, String hNickName) {
this.no = hNo;
this.name = hName;
this.nickname = hNickName;
}
@Override
public String toString() {
return "HeroNode2[" + "no = " + no + ", name = " + name + ", nickname = " + nickname + ']';
}
}