16.螺旋矩阵 II

class Solution {
    public int[][] generateMatrix(int n) {
        int[][] nums=new int[n][n];
        int num=1;//圈数
        int i=0,j=0;
        int x=0,y=0;//起始位置
        int sum=0;//总数
        while(num<=n/2){
            i=y;
            j=x;
            for(;j<n-1-x;j++){
                sum+=1;
                nums[i][j]=sum;
            }
            for(;i<n-1-y;i++){
                sum+=1;
                nums[i][j]=sum;
            }
            for(;j>x;j--){
                sum+=1;
                nums[i][j]=sum;
            }
            for(;i>y;i--){
                sum+=1;
                nums[i][j]=sum;
            }
            x++;
            y++;
            num++;
        }
        if(n%2==1){
            nums[n/2][n/2]=n*n;
        }
        return nums;
    }
}