倒蛇阵
输入
包括一系列的测试用例,每个包含一个整数n,0<=n<=9,n=0时退出程序
输出
对应的倒蛇阵
样例输入
2
3
0
样例输出
4 1
3 2
7 8 1
6 9 2
5 4 3
import java.util.Scanner;
public class H {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int num;
while((num=Integer.parseInt(in.nextLine()))!=0)
{
int[][] arr = new int[100][100];
int i=0, j=num-1, max=num*num,ans=1;
arr[i][j]=1;
while(ans < max)
{
while(i+1 < num&& arr[i+1][j] == 0)
arr[i++][j] = ans++;
while(j-1 >= 0 && arr[i][j-1] == 0)
arr[i][j--] = ans++;
while(i-1 >= 0 && arr[i-1][j] == 0)
arr[i--][j] = ans++;
while(j+1 < num && arr[i][j+1] == 0)
arr[i][j++] = ans++;
}
for(i=0;i<num;i++)
{
for(j=0;j<num;j++)
{
if(arr[i][j]==0)
System.out.print(num*num+" ");
else
{
if(j!=num-1)
System.out.print(arr[i][j]+" ");
else
System.out.print(arr[i][j]);
}
}
System.out.println();
}
}
}
}