双向链表的遍历,添加,修改,删除
class HeroNode4{
public int no;
public String name;
public String nickname;
public HeroNode4 next;
public HeroNode4 pre;
public HeroNode4(int no, String name, String nickname) {
this.no = no;
this.name = name;
this.nickname = nickname;
}
public String toString() {
return "HeroNode [no=" + no + ", name=" + name + ", nickname=" + nickname + "]";
}
}
class DoubleLinkedList{
private HeroNode4 head =new HeroNode4(0,"","");
public HeroNode4 getHead(){
return head;
}
public void list(){
if(head.next == null){
System.out.println("链表为空");
return;
}
HeroNode4 temp = head.next;
while(true){
if(temp == null){
break;
}
System.out.println(temp);
temp = temp.next;
}
}
public void add(HeroNode4 heroNode){
HeroNode4 temp = head;
while(true){
if(temp.next == null){
break;
}
temp = temp.next;
}
temp.next = heroNode;
heroNode.pre = temp;
}
public void update (HeroNode4 newHeroNode){
if(head.next == null){
System.out.println("链表为空");
return;
}
HeroNode4 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.printf("没有找到编号 %d 的节点们不能修改\n", newHeroNode.no);
}
}
public void delete(int no){
if(head.next == null){
System.out.println("链表为空");
return;
}
HeroNode4 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.printf("要删除的%d节点不存在\n",no);
}
}
}