程序里有幾個注釋的地方還是需要特別注意的，根據單鏈表自己的邏輯來寫一遍雙向鏈表，可能有幾個細節處理的不到位。

package DataStructures.LinkedList;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.updata(newHeroNode);doubleLinkedList.list();doubleLinkedList.delete(1);doubleLinkedList.list();} } class DoubleLinkedList{private HeroNode2 head = new HeroNode2(0,"","");public HeroNode2 getHead() {return head;}//刪除一個節點//說明//對于雙向鏈表，直接找到這個節點，進行自我刪除public void delete(int no){if (head.next == null){System.out.println("鏈表為空，無法刪除");}//這里要加next，因為0是不能刪除的HeroNode2 temp = head.next;boolean flag = false;//這里現在是用temp本身來判斷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;}System.out.println("節點刪除成功\n");}else {System.out.printf("沒找到編號為 %d 的節點！刪除失敗\n",no);}}//修改一個節點的內容public void updata(HeroNode2 heroNode){if (head.next == null){System.out.println("鏈表為空位，無法修改");return;}//這里要用next，因為更改的時候頭結點不能找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.printf("沒找到 編號為 %d 的節點\n",heroNode.no);}}//添加節點public void add(HeroNode2 newHeroNode){HeroNode2 temp = head;while(true){if (temp.next == null){break;}temp = temp.next;}//while退出后temp就是鏈表最后節點//形成雙向鏈表temp.next = newHeroNode;newHeroNode.pre = temp;}//遍歷輸出public void list(){if (head.next == null){System.out.println("鏈表為空");return;}//這里要加next要不然打印會把頭結點打印出來HeroNode2 temp = head.next;while (temp != null){System.out.println(temp);temp = temp.next;}}}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;}@Overridepublic String toString() {return "HeroNode2{" +"no=" + no +", name='" + name + '\'' +", nickname='" + nickname + '\'' +'}';} }

加一個添加的時候根據no排序

//添加節點并根據no有序public void addByOrder(HeroNode2 newHeroNode){HeroNode2 temp = head;boolean flag = false;while (true){if (temp.next == null){break;}if (temp.next.no > newHeroNode.no){break;}else if (temp.next.no == newHeroNode.no){flag = true;break;}temp = temp.next;}if (flag){System.out.printf("編號 %d 已存在,不能添加\n",newHeroNode.no);}else {//這里注意不要寫反了，先寫if這里，再寫剩下兩個，要不然就形成了一個環狀，這里找了好久bugif (temp.next != null) {temp.next.pre = newHeroNode;newHeroNode.next = temp.next;}temp.next = newHeroNode;newHeroNode.pre = temp;}}

測試

doubleLinkedList.addByOrder(hero1); doubleLinkedList.addByOrder(hero4); doubleLinkedList.addByOrder(hero2); doubleLinkedList.addByOrder(hero3);doubleLinkedList.list(); 結果：雙向鏈表的測試 HeroNode2{no=1, name='宋江', nickname='及時雨'} HeroNode2{no=2, name='盧俊義', nickname='玉麒麟'} HeroNode2{no=3, name='吳用', nickname='智多星'} HeroNode2{no=4, name='林沖', nickname='豹子頭'} 創作挑戰賽新人創作獎勵來咯，堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的数据结构 - 链表（双向链表学习）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。