1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
| 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.addByOrder(hero3); doubleLinkedList.addByOrder(hero2); doubleLinkedList.addByOrder(hero1); doubleLinkedList.addByOrder(hero4); System.out.println("添加链表~~~"); doubleLinkedList.list(); System.out.println("修改链表~~~"); HeroNode2 newHeroNode = new HeroNode2(4, "小贾", "小贾嗯嗯"); doubleLinkedList.update(newHeroNode); doubleLinkedList.list(); System.out.println("删除后~~~"); doubleLinkedList.del(4); doubleLinkedList.list(); } }
class DoubleLinkedList { private HeroNode2 head = new HeroNode2(0, "", "");
public HeroNode2 getHead() { return head; }
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 add(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.no == heroNode.no) { flag = true; break; } temp = temp.next; } if (flag) { System.out.printf("准备插入的英雄的编号%d已经存在,不能添加\n", heroNode.no); } else { if (temp.next != null) { heroNode.next = temp.next; heroNode.next.pre = heroNode; } 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.printf("没有找到编号%d的节点,不能修改\n", newHeroNode.no); } }
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.printf("要删除的%d节点不存在", 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 "HeroNode2 [no=" + no + ", name=" + name + ", nickname=" + nickname + "]"; } }
|