新建一个双向链表,添加节点到双向链表并输出,输出顺序等于编号大小顺序。
一、代码
package linkedlist;
public class DoubleLinkedListDemo {
public static void main(String[] args) {
HeroNode2 hero1 = new HeroNode2(1, "宋江", "及时雨");
HeroNode2 hero2 = new HeroNode2(2, "卢俊义", "玉麒麟");
HeroNode2 hero3 = new HeroNode2(3, "吴用", "智多星");
HeroNode2 hero4 = new HeroNode2(4, "公孙胜", "入云龙");
HeroNode2 hero5 = new HeroNode2(5, "关胜", "大刀");
HeroNode2 hero6 = new HeroNode2(6, "林冲", "豹子头");
DoubleLinkedList doublelinkedlist1 = new DoubleLinkedList();
doublelinkedlist1.addByOrder(hero1);
doublelinkedlist1.addByOrder(hero6);
doublelinkedlist1.addByOrder(hero5);
doublelinkedlist1.addByOrder(hero2);
doublelinkedlist1.addByOrder(hero3);
doublelinkedlist1.addByOrder(hero4);
System.out.println("按编号顺序输出... ... ...");
doublelinkedlist1.list();
}
}
class DoubleLinkedList{
private HeroNode2 head = new HeroNode2(0, "", "");
public HeroNode2 getHead() {
return head;
}
public void addByAdd(HeroNode2 heronode) {
HeroNode2 temp = head;
while(true) {
if(temp.next == null) {
break;
}
temp = temp.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){
HeroNode2 temp1 = temp.next;
heronode.pre = temp;
heronode.next = temp1;
temp1.pre = heronode;
temp.next = heronode;
}else {
heronode.pre = temp;
heronode.next = null;
temp.next = heronode;
}
}
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 void update(HeroNode2 heronode) {
if(head.next == null) {
System.out.println("双链表为空... ... ...");
return;
}
HeroNode2 temp = head.next;
boolean flag = false;
while(true) {
if(temp == null) {
break;
}
if(temp.no == heronode.no) {
flag = true;
break;
}
temp = temp.next;
}
if(flag) {
temp.name = heronode.name;
temp.nickname = heronode.nickname;
}else {
System.out.println("待修改的节点不存在... ... ...");
}
}
public void del(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("没有找到待删除的节点... ... ...");
}
}
}
class HeroNode2{
public int no;
public String name;
public String nickname;
public HeroNode2 pre;
public HeroNode2 next;
public HeroNode2(int no, String name, String nickname) {
this.no = no;
this.name = name;
this.nickname = nickname;
}
@Override
public String toString() {
return "HeroNode2 [no=" + no + ", name=" + name + ", nickname=" + nickname + "]";
}
}
二、结果
按编号顺序输出... ... ...
HeroNode2 [no=1, name=宋江, nickname=及时雨]
HeroNode2 [no=2, name=卢俊义, nickname=玉麒麟]
HeroNode2 [no=3, name=吴用, nickname=智多星]
HeroNode2 [no=4, name=公孙胜, nickname=入云龙]
HeroNode2 [no=5, name=关胜, nickname=大刀]
HeroNode2 [no=6, name=林冲, nickname=豹子头]