螺旋矩阵（Java）

class Solution {
    public int[][] generateMatrix(int n) {
        int [][]res=new int[n][n];

        int loop=n/2;

        int startX=0;
        int startY=0;
         int offset=1;

         int count=1;

         int mid=n/2;

         while(loop>0){
             int i=startX;
             int j=startY;

             for(;jstartY;j--) res[i][j]=count++;

             for(;i>startX;i--) res[i][j]=count++;

             loop--;

             startX++;
             startY++;
             offset+=2;
         }
         if(n%2==1) res[mid][mid]=count;
         return res;

    }
}