首先对单链表的缺点做一个分析:
- 单向链表查找的方向只能是一个方向,而双向链表可以向后查找
- 单向链表不能自我删除,需要辅助节点,但是双向链表可以自我删除,所以前面我们单链表删除节点时,总是找到temp,因为我们要删除temp.next
分析:
双向链表比单向链表多了一个指向前一个节点的属性pre
双向链表的遍历方式和单项链表一样,可以向前,亦可以向后查找
添加(默认添加到最后一个节点):
先找到双向链表的最后一个节点
然后将节点添加到最后(temp.next=heronode heronode.pre=temp)
删除:找到要删除的节点直接删除即可
temp.pre.next=temp.next
temp.next.pre=temp.pre)
代码实现
public class DoubleLinkedListDemo {
public static void main(String[] args) {
HeroNode heroNode1 = new HeroNode(145, "宋江", "及时雨");
HeroNode heroNode2 = new HeroNode(12, "卢俊义", "玉麒麟");
HeroNode heroNode3 = new HeroNode(81, "吴用", "智多星");
HeroNode heroNode4 = new HeroNode(9, "林冲", "豹子头");
DoubleLinkedList doubleLinkedList = new DoubleLinkedList();
//doubleLinkedList.add(heroNode1);
//doubleLinkedList.add(heroNode2);
//doubleLinkedList.add(heroNode3);
//doubleLinkedList.add(heroNode4);
doubleLinkedList.addByNO(heroNode1);
//doubleLinkedList.addByNO(heroNode2);
//
//doubleLinkedList.addByNO(heroNode3);
//doubleLinkedList.addByNO(heroNode4);
doubleLinkedList.addByNO(heroNode1);
// doubleLinkedList.show();
//doubleLinkedList.del(9);
//System.out.println("删除后的链表");
//doubleLinkedList.show();
//doubleLinkedList.update(new HeroNode(4, "公孙胜", "入云龙"));
//System.out.println("修改后的链表");
//doubleLinkedList.show();
}
//定义双向链表
static class DoubleLinkedList {
HeroNode head = new HeroNode(0, "", "");
//双向链表的添加
public void add(HeroNode heroNode) {
HeroNode temp = head;
while (temp.next != null) {
temp = temp.next;
}
temp.next = heroNode;
heroNode.pre = temp;
}
//双向链表根据no添加
public void addByNO(HeroNode heroNode){
HeroNode temp = head;
while (temp.next!=null){
if (temp.next.no > heroNode.no) {
heroNode.next = temp.next;
temp.next.pre = heroNode;
temp.next = heroNode;
heroNode.pre=temp;
return;
}
if (temp.next.no==heroNode.no){
System.out.printf("要添加的%d节点已经存在\n",heroNode.no);
return;
}
temp = temp.next;
}
temp.next=heroNode;
heroNode.pre=temp;
}
//双向链表的删除
public void del(int no) {
HeroNode temp = head.next;
if (temp == null) {
System.out.println("链表为空,不能删除");
return;
}
while (temp != null) {
if (temp.no == no) {
//删除
temp.pre.next = temp.next;
if (temp.next != null) {
temp.next.pre = temp.pre;
}
return;
}
temp = temp.next;
}
System.out.printf("找不到要删除的%d节点\n", no);
}
//双线链表的修改
public void update(HeroNode heroNode) {
HeroNode temp = head.next;
if (head.next == null) {
System.out.println("链表为空无法修改");
}
while (temp != null) {
if (temp.no == heroNode.no) {
temp.name = heroNode.name;
temp.nikename = heroNode.nikename;
return;
}
temp = temp.next;
}
System.out.printf("不存在要修改的%d节点\n", heroNode.no);
}
//双向链表的显示
public void show() {
HeroNode temp = head.next;
if (head.next == null) {
System.out.println("链表为空,不能显示");
}
while (temp != null) {
System.out.println(temp);
temp = temp.next;
}
}
}
static class HeroNode {
public int no;
public String name;
public String nikename;
public HeroNode next;//指向下一个节点
public HeroNode pre;//指向前一个节点
//构造器
public HeroNode(int no, String name, String nikename) {
this.no = no;
this.name = name;
this.nikename = nikename;
}
//为了显示方便,我们重写一下tostring方法
@Override
public String toString() {
return "HeroNode{" +
"no=" + no +
", name='" + name + '\'' +
", nikename='" + nikename + '\'' +
'}';
}
}
}