回形数java实现

记录一下回形数java实现

效果图：

 

public class huixingshu { // 回形数
    public static void main(String[] args) {
        int n = 8;
        int[][] arr = new int[n][n];
        int maxX = n - 1;
        int maxY = n - 1;
        int minX = 0;
        int minY = 0;
        int count = 0;
        while (count < n * n) {
            for (int x = minX; x <= maxX; x++) {
                arr[minY][x] = ++count;
            }
            minY++;
            for (int y = minY; y <= maxY; y++) {
                arr[y][maxX] = ++count;
            }
            maxX--;
            for (int x = maxX; x >= minX; x--) {
                arr[maxY][x] = ++count;
            }
            maxY--;
            for (int y = maxY; y >= minY; y--) {
                arr[y][minX] = ++count;
            }
            minX++;
        }

        for (int i = 0; i < arr.length; i++) {
            for (int j = 0; j < arr[i].length; j++) {
                System.out.print(arr[i][j] + "\t");
            }
            System.out.println();
        }
    }
}