java 螺旋数据矩阵

private static void print0(int r, int val, int fg) {

int s=r;

int x=-1,y=0;

int f = -1;

int[][] sumr = new int[r][r];

boolean flag = true;

for (int i = 2*r; i > 0; i--) { // 54321

if (flag) {

f = f==1? -1:1;

for (int xi = 0; xi <s; xi++) {

x += f;

sumr[x][y] = val;

val += fg;

}

flag = false;

} else {

flag = true;

s -= 1;

for (int yi = 0; yi <s; yi++) {

y +=f;

sumr[x][y] = val;

val += fg;

}

}

}

for(int a =0;a<sumr.length;a++){

for(int b =0;b<sumr.length;b++){

System.out.print(sumr[b][a]+"\t");

}

System.out.println();

}

}