JAVA 數據結構鍊錶操作循環鍊錶

JAVA 鍊錶操作：循環鍊錶

主要分析示例：

一、單鍊錶循環鍊錶

二、雙鍊錶循環鍊錶

其中單鍊錶節點和雙鍊錶節點類和接口ICommOperate<T>與上篇一致，這裡不在贅述。參考：JAVA鍊錶操作：單鍊錶和雙鍊錶//www.VeVB.COm/article/95113.htm

一、單鍊錶循環鍊錶

package LinkListTest;import java.util.HashMap;import java.util.Map;public class SingleCycleLinkList implements ICommOperate<SNode> { private SNode head = new SNode("HEAD") ; // 公共頭指針，聲明之後不變private int size = 0 ; public int getSize() { return this.size; } /* * 鍊錶插入，每次往末端插入,判定末端的標準為next是否指向head * */ @Override public boolean insertNode(SNode node) { boolean flag = false ; initLinkList() ; // 初始化鍊錶if( this.size==0 ){ // 空鍊錶this.head.setNextNode(node) ; node.setNextNode(this.head) ; }else{ SNode current = this.head ; while( current.getNextNode()!=this.head ){ // 找到末端節點current = current.getNextNode() ; } current.setNextNode(node) ; node.setNextNode(this.head) ; // 循壞鍊錶，尾節點指向head } this.size++ ; flag = true ; return flag; } /* * 插入鍊錶指定位置pos,從1開始,而pos大於size則插入鍊錶末端* */ @Override public boolean insertPosNode(int pos, SNode node) { boolean flag = true ; SNode current = this.head.getNextNode() ; initLinkList() ;// 初始化鍊錶if( this.size==0 ){ // 鍊錶為空this.head.setNextNode(node) ; node.setNextNode(this.head) ;// 循壞鍊錶，尾節點指向head this.size++ ; }else if( this.size<pos ){ // pos位置大於鍊錶長度，插入末端insertNode(node) ; }else if( pos>0 && pos<=this.size ){ // 鍊錶內節點// 1、找到要插入pos位置節點和前節點，node將插入兩個節點之間int find = 0; SNode preNode = this.head; // 前節點SNode currentNode = current; // 當前節點while( find<pos-1 && currentNode!=this.head ){ preNode = current ; // 前節點後移currentNode = currentNode.getNextNode() ; // 當前節點後移find++ ; if( find<pos-1 && currentNode!=this.head ){ // 未結束尋找節點前，後移前節點current = current.getNextNode() ; } }// System.out.println(preNode);// System.out.println(currentNode); // 2、插入節點preNode.setNextNode(node); node.setNextNode(currentNode); this.size++ ; }else { System.out.println("位置信息錯誤"); flag = false ; } return flag; } private void initLinkList(){ if( size==0 ){ this.head.setNextNode(this.head); } } /* * 指定鍊錶的節點pos，刪除對應節點。方式：找到要刪除節點的前後節點,進行刪除,下標從1開始* */ @Override public boolean deleteNode(int pos) { boolean flag = false; SNode current = this.head.getNextNode() ; if( pos<=0 || pos>this.size || current==this.head ){ System.out.println("位置信息錯誤或鍊錶無信息"); }else{ // 1、找到要刪除節點的前後節點int find = 0; SNode preNode = this.head; // 前節點SNode nextNode = current.getNextNode(); // 後節點while( find<pos-1 && nextNode!=this.head ){ preNode = current ; // 前節點後移nextNode = nextNode.getNextNode() ; // 後節點後移find++ ; if( find<pos-1 && nextNode!=this.head ){ // 未結束找節點前，後移"前節點" current = current.getNextNode() ; } }// System.out.println(preNode);// System.out.println(nextNode); // 2、刪除節點preNode.setNextNode(nextNode); System.gc(); // 回收刪除節點this.size-- ; flag = true ; } return flag; } /* * 指定鍊錶的節點pos，修改對應節點,下標從1開始* */ @Override public boolean updateNode(int pos, Map<String, Object> map) { boolean flag = false ; SNode node = getNode(pos, map); // 獲得相應位置pos的節點if( node!=null ){ String data = (String) map.get("data") ; node.setData(data); flag = true ; } return flag; } /* * 找到指定鍊錶的節點pos,下標從1開始* */ @Override public SNode getNode(int pos, Map<String, Object> map) { SNode current = this.head.getNextNode() ; if( pos<=0 || pos>this.size || current==this.head ){ System.out.println("位置信息錯誤或鍊錶不存在"); return null; } int find = 0 ; while( find<pos-1 && current!=this.head ){ current = current.getNextNode() ; find++ ; } return current; } /* * 打印鍊錶* */ @Override public void printLink() { int length = this.size ; if( length==0 ){ System.out.println("鍊錶為空！ "); return ; } SNode current = this.head.getNextNode() ; System.out.println("總共有節點數: " + length +" 個"); int find = 0 ; while( current!=this.head ){ System.out.println("第" + (++find) + " 個節點：" + current); current=current.getNextNode() ; } } public static void main(String[] args) { SingleCycleLinkList scll = new SingleCycleLinkList() ; SNode node1 = new SNode("節點1"); SNode node2 = new SNode("節點2"); SNode node3 = new SNode("節點3"); SNode node4 = new SNode("節點4"); SNode node5 = new SNode("節點5"); SNode node6 = new SNode("插入指定位置");// scll.insertPosNode(scll.getSize()+1, node1) ;// scll.insertPosNode(scll.getSize()+1, node2) ;// scll.insertPosNode(scll.getSize()+1, node3) ;// scll.insertPosNode(scll.getSize()+1, node4) ;// scll.insertPosNode(scll.getSize()+1, node5) ; scll.insertNode(node1); scll.insertNode(node2); scll.insertNode(node3); scll.insertNode(node4); scll.insertNode(node5); System.out.println("*******************輸出鍊錶*******************"); scll.printLink(); System.out.println("*******************獲得指定鍊錶節點*******************"); int pos = 2 ; System.out.println("獲取鍊錶第"+pos+" 個位置數據："+scll.getNode(pos, null)); System.out.println("*******************向鍊錶指定位置插入節點*******************"); int pos1 = 3 ; System.out.println("將數據插入第"+pos1+"個節點："); scll.insertPosNode(pos1, node6) ; scll.printLink(); System.out.println("*******************刪除鍊錶指定位置節點*******************"); int pos2 = 3 ; System.out.println("刪除第"+pos2+"個節點："); scll.deleteNode(pos2) ; scll.printLink(); System.out.println("*******************修改鍊錶指定位置節點*******************"); int pos3 = 3 ; System.out.println("修改第"+pos3+"個節點："); Map<String, Object> map = new HashMap<>() ; map.put("data", "this is a test") ; scll.updateNode(pos3, map) ; scll.printLink(); }}

二、雙鍊錶循環鍊錶

package LinkListTest;import java.util.HashMap;import java.util.Map;public class DoubleCycleLinkList implements ICommOperate<DNode>{ private DNode head = new DNode("HEAD"); // 公共頭指針，聲明之後不變private int size = 0 ; // 記錄鍊錶節點數量public int getSize() { return this.size; } /* * 鍊錶插入，每次往末端插入,判定末端的標準為next是否指向head * */ @Override public boolean insertNode(DNode node) { boolean flag = false ; initLinkList() ; // 初始化鍊錶DNode current = this.head ; if( this.size==0 ){ // 空鍊錶this.head.setNextNode(node) ; node.setPriorNode(this.head); node.setNextNode(this.head) ; }else{ // 鍊錶內節點while( current.getNextNode()!=this.head ){ // 找到末端節點current = current.getNextNode() ; } current.setNextNode(node) ; node.setPriorNode(current); node.setNextNode(this.head) ; // 循壞鍊錶，尾節點指向head } this.size++ ; flag = true ; return flag; } /* * 插入鍊錶指定位置pos,從1開始,而pos大於size則插入鍊錶末端* */ @Override public boolean insertPosNode(int pos, DNode node) { boolean flag = true; initLinkList() ; // 初始化鍊錶DNode current = this.head.getNextNode() ; if( this.size==0 ){ // 鍊錶為空this.head.setNextNode(node) ; node.setPriorNode(this.head); node.setNextNode(this.head) ; this.size++ ; }else if( pos>this.size ){ // pos位置大於鍊錶長度，插入末端insertNode(node) ; }else if( pos>0 && pos<=this.size ){ // 鍊錶內節點// 1、找到要插入位置pos節點,插入pos節點當前位置int find = 0; while( find<pos-1 && current.getNextNode()!=this.head ){ current = current.getNextNode() ; find++ ; } // 2、插入節點if( current.getNextNode()==this.head ){ // 尾節點node.setPriorNode(current); node.setNextNode(this.head); current.setNextNode(node); } else if( current.getNextNode()!=this.head ) { //中間節點node.setPriorNode(current.getPriorNode()); node.setNextNode(current); current.getPriorNode().setNextNode(node); current.setPriorNode(node); } this.size++ ; }else{ System.out.println("位置信息錯誤"); flag = false ; } return flag; } private void initLinkList(){ if( size==0 ){ this.head.setNextNode(this.head); this.head.setPriorNode(this.head); } } /* * 指定鍊錶的節點pos，刪除對應節點。方式：找到要刪除節點的前後節點刪除,下標從1開始* */ @Override public boolean deleteNode(int pos) { boolean flag = false; DNode current = this.head.getNextNode() ; if( pos<=0 || pos>this.size || current==this.head ){ System.out.println("位置信息錯誤或鍊錶不存在"); }else{ // 1、找到要刪除位置pos節點int find = 0; while( find<pos-1 && current.getNextNode()!=this.head ){ current = current.getNextNode() ; find++ ; } // 2、刪除節點if( current.getNextNode()==this.head ){ // 尾節點current.getPriorNode().setNextNode(this.head) ; } else if( current.getNextNode()!=this.head ) { //中間節點current.getPriorNode().setNextNode(current.getNextNode()) ; current.getNextNode().setPriorNode(current.getPriorNode()) ; } System.gc(); // 回收刪除節點this.size-- ; flag = true ; } return flag; } /* * 指定鍊錶的節點pos，修改對應節點,下標從1開始* */ @Override public boolean updateNode(int pos, Map<String, Object> map) { boolean flag = false ; DNode node = getNode(pos, map); if( node!=null ){ String data = (String) map.get("data") ; node.setData(data); flag = true ; } return flag; } /* * 找到指定鍊錶的節點pos,下標從1開始* */ @Override public DNode getNode(int pos, Map<String, Object> map) { DNode current = this.head.getNextNode() ; if( pos<=0 || pos>this.size || current==this.head ){ System.out.println("位置信息錯誤或鍊錶不存在"); return null; } int find = 0 ; while( find<pos-1 && current!=this.head ){ current = current.getNextNode() ; find++ ; } return current; } /* * 打印鍊錶* */ @Override public void printLink() { int length = this.size ; if( length==0 ){ System.out.println("鍊錶為空！ "); return ; } DNode current = this.head.getNextNode() ; int find = 0 ; System.out.println("總共有節點數: " + length +" 個"); while( current!=this.head ){ System.out.println("第" + (++find) + " 個節點：" + current); current=current.getNextNode() ; } } public static void main(String[] args) { DoubleCycleLinkList dcll = new DoubleCycleLinkList() ; DNode node1 = new DNode("節點1"); DNode node2 = new DNode("節點2"); DNode node3 = new DNode("節點3"); DNode node4 = new DNode("節點4"); DNode node5 = new DNode("節點5"); DNode node6 = new DNode("插入指定位置"); dcll.insertPosNode(10, node1) ; dcll.insertPosNode(10, node2) ; dcll.insertPosNode(8, node3) ; dcll.insertPosNode(88, node4) ; dcll.insertPosNode(8, node5) ;// dcll.insertNode(node1);// dcll.insertNode(node2);// dcll.insertNode(node3);// dcll.insertNode(node4);// dcll.insertNode(node5); System.out.println("*******************輸出鍊錶*******************"); dcll.printLink(); System.out.println("*******************獲得指定鍊錶節點*******************"); int pos = 2 ; System.out.println("獲取鍊錶第"+pos+"個位置數據："+dcll.getNode(pos, null)); System.out.println("*******************向鍊錶指定位置插入節點*******************"); int pos1 = dcll.getSize()+1 ; System.out.println("將數據插入第"+pos1+"個節點："); dcll.insertPosNode(pos1, node6) ; dcll.printLink(); System.out.println("*******************刪除鍊錶指定位置節點*******************"); int pos2 = 7 ; System.out.println("刪除第"+pos2+"個節點："); dcll.deleteNode(pos2) ; dcll.printLink(); System.out.println("*******************修改鍊錶指定位置節點*******************"); int pos3 = 3 ; System.out.println("修改第"+pos3+"個節點："); Map<String, Object> map = new HashMap<>() ; map.put("data", "this is a test") ; dcll.updateNode(pos3, map) ; dcll.printLink(); }}

感謝閱讀，希望能幫助到大家，謝謝大家對本站的支持！