实现双向链表
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 +
'}';
}
}
创建双向链表
class DoubleList{
private HeroNode2 head = new HeroNode2(0,"","");
public HeroNode2 getHead() {
return head;
}
public void add(HeroNode2 heroNode){
HeroNode2 temp = head;
while (true){
if (temp.next == null){
break;
}
temp = 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("没有找到此编号的节点");
}
}
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("要删除的节点不存在");
}
}
public void list(){
if (head.next==null){
System.out.println("链表为空");
return;
}
HeroNode2 temp = head.next;
while (true){
if (temp==null){
break;
}
System.out.println(temp);
temp = temp.next;
}
}
}
测试
public static void main(String[] args) {
HeroNode2 h1 = new HeroNode2(1, "宋江", "及时雨");
HeroNode2 h2 = new HeroNode2(2, "卢俊义", "玉麒麟");
HeroNode2 h3 = new HeroNode2(3, "吴用", "智多星");
HeroNode2 h4 = new HeroNode2(4, "林冲", "豹子头");
DoubleList doubleLinked = new DoubleList();
doubleLinked.add(h1);
doubleLinked.add(h2);
doubleLinked.add(h3);
doubleLinked.add(h4);
doubleLinked.list();
}