java实现双向链表

public class DoubleLinkedlistDemo {
	public static void main(String[] args) {
		// 测试
		System.out.println("双向链表的测试");
		// 先创建节点
		HeroNode2 hero1 = new HeroNode2(1, "宋江", "及时雨");
		HeroNode2 hero2 = new HeroNode2(2, "卢俊义", "玉麒麟");
		HeroNode2 hero3 = new HeroNode2(3, "吴用", "智多星");
		HeroNode2 hero4 = new HeroNode2(4, "林冲", "豹子头");
		// 创建一个双向链表
		DoubleLinkedlist doubleLinkedList = new DoubleLinkedlist();
		doubleLinkedList.add(hero1);
		doubleLinkedList.add(hero2);
		doubleLinkedList.add(hero3);
		doubleLinkedList.add(hero4);
		doubleLinkedList.list();
		
		HeroNode2 newHeroNode = new HeroNode2(4, "公孙胜", "入云龙");
		doubleLinkedList.update(newHeroNode);
		System.out.println("修改后的链表情况");
		doubleLinkedList.list();
		
		doubleLinkedList.del(3);
		System.out.println("删除后的链表情况~~");
		doubleLinkedList.list();

	}
}

class DoubleLinkedlist {
	private HeroNode2 head = new HeroNode2(0, "", "");

	public void add(HeroNode2 heronode) {
		HeroNode2 temp = head;
		while (temp.next != null) {
			temp = temp.next;
		}
		temp.next = heronode;
		heronode.pre = temp;
	}

	public void list() {
		HeroNode2 temp = head.next;
		if (temp == null) {
			System.out.println("链表为空");
		}
		while (temp != null) {
			System.out.println(temp.toString());
			temp = temp.next;
		}
	}

	public void del(int no) {
		HeroNode2 temp = head.next;
		boolean flag = false;
		if (temp == null) {
			System.out.println("链表为空，不能删除");
			return;
		}
		while (temp != null) {
			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 + "号英雄不存在");
		}
	}

	public void update( HeroNode2 newHeroNode2) {
		HeroNode2 temp = head.next;
		boolean flag = false;
		if (temp == null) {
			System.out.println("链表为空,不能修改");
		}
		while (temp != null) {
			if (temp.no == newHeroNode2.no) {
				flag=true;
				break;
			}
			temp=temp.next;
		}
		if(flag) {
			temp.name=newHeroNode2.name;
			temp.nickname=newHeroNode2.nickname;
		}else {
			System.out.println("第" + newHeroNode2.no + "号英雄不存在");
		}
	}
}

class HeroNode2 {
	public int no;
	public String name;
	public String nickname;
	public HeroNode2 next;
	public HeroNode2 pre;

	public HeroNode2(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 + "]";
	}

}