2022.03.12(LC_59_螺旋矩阵Ⅱ)

 解题思路：与螺旋矩阵类似。

class Solution {
    public int[][] generateMatrix(int n) {
        int[][] res = new int[n][n];
        if (n < 1) return res;
        int up = 0, down = n - 1, left = 0, right = n - 1;
        int i = 1;
        while (true) {
            //从左至右
            for (int col = left; col <= right; col++) {
                res[up][col] = i++;
            }
            if (++up > down) break;

            //从上至下
            for (int row = up; row <= down; row++) {
                res[row][right] = i++;
            }
            if (--right < left) break;

            //从右至左
            for (int col = right; col >= left; col--) {
                res[down][col] = i++;
            }
            if (--down < up) break;

            //从下至上
            for (int row = down; row >= up; row--) {
                res[row][left] = i++;
            }
            if (++left > right) break;
        }
        return res;
    }
}