java 螺旋方阵_JAVA 打印 M*N的螺旋矩阵（递归） 效率低得很 | 学步园

import java.io.*;

import java.util.*;

public class LXM {

int m;

int n;

int jz[][];

int num;

LXM()throws IOException{

Scanner cin = new Scanner(new BufferedReader(new InputStreamReader(System.in)));

while(true){

m=cin.nextInt();

n=cin.nextInt();

if(m==0&&n==0){

System.out.println("Game over!");

break;

}

jz = new int [m][n];

solve();

for(int i=0;i

for(int j=0;j

System.out.print(jz[i][j]);

if(j!=n-1)System.out.print("/t");

}

System.out.println();

}

}

}

void solve(int x,int y,int z){

jz[x][y]=num;

num++;

/*

*依次递归赋值

*/

switch(z){