您好,登錄后才能下訂單哦!
這篇文章給大家介紹Java中怎么利用雙鏈表互相交換任意兩個(gè)節(jié)點(diǎn),內(nèi)容非常詳細(xì),感興趣的小伙伴們可以參考借鑒,希望對(duì)大家能有所幫助。
概述:
雙向鏈表也叫雙鏈表,是鏈表的一種,它的每個(gè)數(shù)據(jù)結(jié)點(diǎn)中都有兩個(gè)指針,分別指向直接后繼和直接前驅(qū)。所以,從雙向鏈表中的任意一個(gè)結(jié)點(diǎn)開始,都可以很方便地訪問它的前驅(qū)結(jié)點(diǎn)和后繼結(jié)點(diǎn)。一般我們都構(gòu)造雙向循環(huán)鏈表。
思路:
1、確定兩個(gè)節(jié)點(diǎn)的先后順序
2、next、prev互相交換順序以及將換向前方的節(jié)點(diǎn)與之前的節(jié)點(diǎn)對(duì)接。(1.prev.next = 2)
3、判斷是否相鄰
實(shí)現(xiàn)代碼:
鏈表類:
public class SLink { public SNode head; public SLink() { this.head = new SNode(); } public boolean interChangeById(int id1,int id2) { SNode s = head; SNode node1 = null,node2 = null; int node1Count,node2Count; node1Count = node2Count = 0; if(id1 == id2) { return true; } /** * 向下遍歷 */ while (s.next != null) { s = s.next; node1Count ++ ; if(s.student.stuId == id1) { /** * 記錄節(jié)點(diǎn)1 */ node1 = s; break; } } s = head; while (s.next != null) { s = s.next; node2Count ++ ; if(s.student.stuId == id2) { /** * 記錄節(jié)點(diǎn)2 */ node2 = s; break; } } if(node1 != null && node2 != null) { SNode temp = new SNode(); /** * node1在后 */ if(node1Count > node2Count) { temp.next = node1.next; temp.prev = node1.prev; /** * 記錄那個(gè)節(jié)點(diǎn)就先處理那個(gè)節(jié)點(diǎn) * 1、交換next * 2、交換prev * 3、設(shè)置之前節(jié)點(diǎn)的next(對(duì)接) */ node1.next = node2.next; node1.prev = node2.prev; node2.prev.next = node1; if(node1.next.equals(node1)) { /** * 說明兩個(gè)節(jié)點(diǎn)相鄰 */ node1.next = node2; node2.next = temp.next; node2.prev = node1; }else { /** * 說明節(jié)點(diǎn)不相鄰 */ node2.next = temp.next; node2.prev = temp.prev; temp.prev.next = node2; } }else { /** * node1在前 */ temp.next = node2.next; temp.prev = node2.prev; node2.next = node1.next; node2.prev = node1.prev; node1.prev.next = node2; if(node2.next.equals(node2)) { node2.next = node1; node1.next = temp.next; node1.prev = node2; }else { node1.next = temp.next; node1.prev = temp.prev; temp.prev.next = node1; } } return true; } return false; } public void displayStudent() { SNode s = head; while (s.next != null) { s = s.next; System.out.println(s.student); } } }
節(jié)點(diǎn)類:
public class SNode { public Student student; public SNode next; public SNode prev; public SNode(Student student, SNode prev,SNode next) { this.student = student; this.next = next; this.prev = prev; } public SNode() { this.student = null; this.next = null; this.prev = null; } }
Student類:
public class Student { public int stuId; public String name; public int age; public String className; public Student(int stuId, String name, int age, String className) { this.stuId = stuId; this.name = name; this.age = age; this.className = className; } public int getStuId() { return stuId; } public void setStuId(int stuId) { this.stuId = stuId; } public String getName() { return name; } public void setName(String name) { this.name = name; } public int getAge() { return age; } public void setAge(int age) { this.age = age; } public String getClassName() { return className; } public void setClassName(String className) { this.className = className; } @Override public String toString() { return "Student{" + "stuId=" + stuId + ", name='" + name + '\'' + ", age=" + age + ", className='" + className + '\'' + '}'; } }
關(guān)于Java中怎么利用雙鏈表互相交換任意兩個(gè)節(jié)點(diǎn)就分享到這里了,希望以上內(nèi)容可以對(duì)大家有一定的幫助,可以學(xué)到更多知識(shí)。如果覺得文章不錯(cuò),可以把它分享出去讓更多的人看到。
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場,如果涉及侵權(quán)請(qǐng)聯(lián)系站長郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。