顺时针旋转输出数字

输出结果

Java实现方式

package learnbase;

public class Thinking {
    public static void main(String[] args) {
        // 要输出的最大的数
        int max = 120;
        //根据最大数值计算二维数组的行数
        double sqrt = Math.sqrt(max);
        int rows = (sqrt % 1 == 0 ? (int) sqrt : (int) sqrt + 1);
        //初始化二维数组
        int[][] data = new int[rows][rows];
        //记录每一次旋转走的步数
        int count = 1;
        //当前数字
        int num = 1;
        //初始化1所在二维数组的位置
        int lastRow = (rows + 1) / 2 - 1;
        int lastCol = lastRow;
        data[lastRow][lastCol] = 1;
        //旋转方向：是否向右、下旋转，反之，则向左、上旋转
        boolean forward = true;
        outter: while (true) {
            if (forward) {
                // 横移：向右走
                for (int i = 0; i < count; i++) {
                    data[lastRow][++lastCol] = ++num;
                    if (num == max) {
                        break outter;
                    }
                }
                // 竖移：向下走
                for (int i = 0; i < count; i++) {
                    data[++lastRow][lastCol] = ++num;
                    if (num == max) {
                        break outter;
                    }
                }
            } else {
                // 横移：向左走
                for (int i = 0; i < count; i++) {
                    data[lastRow][--lastCol] = ++num;
                    if (num == max) {
                        break outter;
                    }
                }
                // 竖移：向上走
                for (int i = 0; i < count; i++) {
                    data[--lastRow][lastCol] = ++num;
                    if (num == max) {
                        break outter;
                    }
                }
            }
            //由右下转为左上
            forward = !forward;
            count++;
        }
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < rows; j++) {
                System.out.print(data[i][j] + "  ");
            }
            System.out.println("");
        }

    }
}