59. 螺旋矩阵 ||

59. 螺旋矩阵

class Solution {
    public int[][] generateMatrix(int n) {
        int[][] res = new int[n][n]; //创建二维数组
        int startx = 0,starty = 0; //起始位置
        int offset = n-1; //每圈每一部分走的长度
        int loop = n/2; //循环次数
        int mid = n/2; //中间位置
        int count = 1; //填充数字
        int i,j;
        while(loop > 0){
            i = startx;
            j = starty;
            //上行：从左到右(左闭右开)
            for(;j < starty + offset;j++){
                res[startx][j] = count++;
            }
            //右行：从上到下(上闭下开)
            for(;i < startx + offset;i++){
                res[i][j] = count++;
            }
            //下行：从右到左(右闭左开)
            for(;j > starty;j--){
                res[i][j] = count++;
            }
            //左行：从下到上(下闭右开)
            for(;i > startx;i--){
                res[i][j] = count++;
            }
            loop--;
            //起始点更新
            startx += 1;
            starty += 1;
            //每圈每一步走的长度-2
            offset -= 2;
        }
        if (n % 2 == 1){
            res[mid][mid] = count;
        }
        return res;
    }
}