鏈表的有關(guān)操作

《鏈表的有關(guān)操作》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在教育資源-天天文庫(kù)。

1、publicclassSingleLinkedList>{privatestaticclassNode{publicAnyTypedata;publicNodenextNode;publicNode(AnyTyped,Noden){data=d;nextNode=n;}publicNode(AnyTyped){data=d;nextNode=null;}publicNode(){data=null;nextNode=null;

2、}}privateinttheSize;//表的大小privateNodeheadNode;//單鏈表的頭節(jié)點(diǎn)publicSingleLinkedList(){//構(gòu)造空單鏈表headNode=null;theSize=0;}publicintsize(){//單鏈表的大小returntheSize;}publicAnyTypeget(intidx){returngetNode(idx).data;}publicAnyTypeset(intidx,AnyTypenewVal){Nodep=getNode(idx);AnyT

3、ypeoldVal=p.data;p.data=newVal;returnoldVal;}privateNodegetNode(intidx){Nodep;if(idx<0

4、

5、idx>size())thrownewIndexOutOfBoundsException("getNodeindex:"+idx+";size:"+size());p=headNode;for(inti=0;i

6、e(),x);returntrue;}publicvoidadd(intidx,AnyTypex){NodenewNode=newNode(x);if(this.headNode==null

7、

8、idx==0){//邊界條件：空表插入或者在idx=0的節(jié)點(diǎn)之前插入Nodeq=newNode(x);newNode.nextNode=headNode;headNode=newNode;theSize++;}else{//單鏈表非空并且idx>0Nodep;p=getNode(

9、idx-1);newNode.nextNode=p.nextNode;p.nextNode=newNode;theSize++;}}publicbooleanremove(intidx){if(headNode==null)returnfalse;if(idx==0

10、

11、this.headNode.nextNode==null){//只有一個(gè)數(shù)據(jù)元素Nodep=this.headNode;headNode=null;theSize--;}else{Nodep=getNode(idx-1),q;q=p.nextNode;p.n

12、extNode=q.nextNode;theSize--;}returntrue;}publicintgetSize(SingleLinkedListLa){intcount=0;Nodep=La.headNode;if(La.headNode==null)return0;while(p!=null){++count;p=p.nextNode;}returncount;}publicintcontains(AnyTypex,SingleLinkedListLa){intidx=0;Nodep=La.hea

13、dNode;if(La.headNode==null)return-1;while(p.data!=x){idx++;p=p.nextNode;if(p==null)return-1;}returnidx;}publicvoidmergeSort(SingleLinkedListLa,SingleLinkedListLb,SingleLinkedListLc){Nodepa=La.headNode,pb=Lb.headNode,tmp;while(pa!=null&&pb!=null){//合并if(pa.data.compareTo(pb

14、.data)<0){tmp=pa;pa=pa.nex