二維數(shù)組螺旋排序

1、二維數(shù)組螺旋輸出例如:輸入數(shù)組12345678910111213141516輸出數(shù)組12341213145111615610987Java實(shí)現(xiàn)方案ArrClass.java/*二維數(shù)組的元素進(jìn)行螺旋排列，二維數(shù)組是有序的，輸出螺旋排序*authorzdd*/publicclassArrClassprivateintl,r,u,d;/左右上下privateintn,m;/行列privateinti,j;/當(dāng)前走到的位置;privateintarr;/結(jié)果集privateenumDirection/枚舉right,down,left,up;privateDirectionpos;privatevo

2、idinit(intn,intm)this.n=n;this.m=m;this.l=-1;/左邊界this.r=m;/右邊界this.u=0;/上邊界this.d=n;/下邊界this.i=0;this.j=0;this.arr=newintnm;this.pos=Direction.right;/初始向右走/*處理,螺旋排序*paramarr二維數(shù)組,每行的列數(shù)必須相同;*paramn參數(shù)arr的行數(shù)*paramm參數(shù)arr的列數(shù)*/publicvoiddeal(Integerarr,intn,intm)this.init(n,m);for(inti=0;in;i+)for(intj=0;j

3、m;j+)intd=arrij;booleanflag=push(d);while(!flag)flag=push(d);privatebooleanpush(intdata)if(pos=Direction.right)/向右if(jr)arrij=data;j+;returntrue;elsej-;i+;r-;pos=Direction.down;returnfalse;elseif(pos=Direction.down)/向下if(il)arrij=data;j-;returntrue;elsej+;i-;l+;pos=Direction.up;returnfalse;else/向上if

4、(iu)arrij=data;i-;returntrue;elsei+;j+;u+;pos=Direction.right;returnfalse;/*矩陣形式輸出,空格分割開;*/publicvoidprint()for(inti=0;in;i+)for(intj=0;jm;j+)System.out.print(arrij);if(jm-1)System.out.print();if(in-1)System.out.println();/*get方法,獲取結(jié)果集;*returnarr處理后的二維數(shù)組;*/publicintgetArr()returnarr;/二維數(shù)組的元素進(jìn)行螺旋排列，二

5、維數(shù)組是有序的，螺旋排序如表所示/輸入：將從一個(gè)整形T開始，表示后續(xù)有T個(gè)實(shí)例。/每個(gè)實(shí)例第一行的兩個(gè)整數(shù)NM表示二維數(shù)組行列數(shù)，/表示有N行數(shù)每行M個(gè)數(shù)構(gòu)成數(shù)組，數(shù)組都是已經(jīng)排序好的（排序數(shù)組）。/輸出：打印出螺旋排序后的數(shù)組/樣例輸入：/1/44/1234/5678/9101112/13141516/樣例輸出：/1234/1213145/1116156/10987測(cè)試用例:Main.javaimportjava.util.Scanner;publicclassMainpublicstaticvoidmain(Stringargs)Scannerscanner=newScanner(System.in);intnum=scanner.nextInt();intt=0;ArrClassac=newArrClass();while(tnum)Integern=scanner.nextInt();Integerm=scanner.nextInt();Integerarr=newIntegernm;for(inti=0;in;i+)for(intj=0;jm;j+)arrij=scanner.nextInt();ac.deal(arr,n,m);ac.print();t+;if(tnu