LeetCode-59. 螺旋矩阵 II-Java-medium

题目链接

法一

    public int[][] generateMatrix(int n) {
        int[][] ans = new int[n][n];
        int row = n, col = n, step = 1;
        int up = 0, down = row - 1, left = -1, right = col - 1; // 确定上下左右四条边的位置
        while (step <= n * n) {
            for (int i = ++left; i <= right; i++) ans[up][i] = step++; // 填充上行从左到右
            for (int i = ++up; i <= down; i++) ans[i][right] = step++; // 填充右列从上到下
            for (int i = --right; i >= left; i--) ans[down][i] = step++; // 填充下行从右到左
            for (int i = --down; i >= up; i--) ans[i][left] = step++; // 填充左列从下到上
        }
        return ans;
    }

本地测试

        /**
         * 59. 螺旋矩阵 II
         */
        lay.showTitle(59);
        Solution59 sol59 = new Solution59();
        int[][] matrix59 = sol59.generateMatrix(4);
        arrayOpt.showIntTwoDimArray(matrix59, matrix59.length);