算法--数组的下标控制n*n的矩阵

/*
 * 3. 打印一个 N*N 的方阵，Ｎ为每边 Ｎ＝１５ 打印出下面图形 

字符的个数（３＜Ｎ＜２０）, 要求                

外一层为"T", 第二层为"J", 从第三层         
起每层依次打印数字 1,2,3,...            

（右图以Ｎ为１５为例）

 

TTTTTTTTTTTTTTT  
TJJJJJJJJJJJJJJJT  
TJ11111111111JT              
TJ12222222221JT
TJ12333333321JT
TJ12344444321JT
TJ12345554321JT
TJ12345654321JT
TJ12345554321JT
TJ12344444321JT
TJ12333333321JT
TJ12222222221JT
TJ11111111111JT
TJJJJJJJJJJJJJJJT
TTTTTTTTTTTTTTT


 * 
 */
public class Test9 {
public static void main(String[] args) {
/*System.out.println("请输入数字n:");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();*/
int n =15;
String[][] arr = new String[n][n];
test9(arr,0,0);
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length; j++) {
System.out.print( " "+arr[i][j]);
}
System.out.println();
}
}
public static void test9(String[][] arr,int x,int y){
if(x>(arr.length/2)&&y>(arr.length/2)){
return;
}
String s = (x-1)+"";//当在第二圈以后的时候
if(y==0&&x==0){//第一圈
s = "T";
}
if(y==1&&x==1){//第二圈
s="J";
}
for (int i = 0; i < arr.length-(x+y); i++) {
arr[x+i][y] = s; //左
arr[x][y+i]=s;//上
arr[arr.length-1-x][y+i]=s; //下
arr[x+i][arr.length-1-x]=s;//右
}
test9(arr,++x,++y);
}
}