package com.java.arraysdemo;
import java.util.Scanner;
public class huiXing {
    public static void main(String[] args) {
        System.out.println("请输入一个正整数：");
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int [][] array = new int[n][n];
        int count = 0;  //要显示的数值
        int minX = 0;   //X轴最小值
        int maxX = n-1; //X轴最大值
        int minY = 0;   //Y轴最小值
        int maxY = n-1; //Y轴最大值
        while(minY <= maxY){
            for (int i = minY; i < maxY; i++) {
                array[minX][i] = ++count;
            }
            for (int i = minX; i < maxX; i++) {
                array[i][maxY] = ++count;
            }
            for (int i = maxY; i > minY ; i--) {
                array[maxX][i] = ++count;
            }
            for (int i = maxX; i > minX ; i--) {
                array[i][minY] = ++count;
            }
            //每走一圈，就往中心靠近一步！
            maxX--;
            minY++;
            minX++;
            maxY--;
        }
        System.out.println("最终输出的回形数为：");
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array.length; j++) {
                if(n%2 != 0){   //输入数为奇数的时候需要做加一处理，我这里直接n*n进行赋值。
                    array[n/2][n/2] = n*n;
                }
                System.out.print(array[i][j]+"\t");
            }
            System.out.println();
        }
    }
}