59.螺旋矩阵II

给你一个正整数 n ，生成一个包含 1 到 n2 所有元素，且元素按顺时针顺序螺旋排列的 n x n 正方形矩阵 matrix 。

示例 1：

输入：n = 3
输出：[[1,2,3],[8,9,4],[7,6,5]]

示例 2：

输入：n = 1
输出：[[1]]

提示：

• 1 <= n <= 20

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
         vector<vector<int>> res(n, vector<int>(n, 0));
        int startx=0;
        int starty=0;
        int loop=n/2;
        int offset=1;
        int count=1;
        int i,j;
        while(loop--){
            for(j=starty;j<n-offset;j++){
                 res[startx][j]=count;
                 count++;
            }
            for(i=startx;i<n-offset;i++){
                res[i][n-offset]=count;
                count++;
            }
            for(;j>starty;j--){
                res[n-offset][j]=count;
                count++;
            }
            for(;i>startx;i--){
                res[i][starty]=count;
                count++;
            }
            startx++;
            starty++;
            offset++;
        }
          if(n%2){
              res[startx][starty]=count;
          }
          return res;
    }
};

class Solution {
    public int[][] generateMatrix(int n) {
        int[][] res=new int[n][n];//JAVA的特点
        int startx=0;
        int starty=0;
        int loop=n/2;
        int count=1;
        int offset=1;
        while(loop>0){//注意java的特殊语法
            int i,j;
            for(j=starty;j<n-offset;j++){
                res[startx][j]=count++;
            }
            for(i=startx;i<n-offset;i++){
                res[i][n-offset]=count++;
            }
            for(;j>starty;j--){
                res[n-offset][j]=count++;
            }
            for(;i>startx;i--){
                res[i][starty]=count++;
            }
            startx++;
            starty++;
            offset++;
            loop--;
        }
        if(n%2==1){ //注意java的特殊语法
            res[startx][starty]=count;
        }
        return res;
    }
}

class Solution:
    def generateMatrix(self, n: int) -> List[List[int]]:
        res = [[0] * n for _ in range(n)]
        startx=0
        starty=0
        loop=n//2 #//代表返回整数结果
        count=1
        offset=1
        while loop>0:
            for j in range(starty,n-offset):
                res[startx][j]=count
                count+=1
            for i in range(startx,n-offset):
                res[i][n-offset]=count
                count+=1
            for j in range(n-offset,starty,-1):
                res[n-offset][j]=count
                count+=1
            for i in range(n-offset,startx,-1):
                res[i][starty]=count
                count+=1
            offset+=1
            loop-=1
            startx+=1
            starty+=1
        if n%2 == 1:
            res[startx][starty]=count
        return res