题记-螺旋矩阵||

螺旋矩阵||

模拟,顺序就是右下左上

class Solution {
    public int[][] generateMatrix(int n) {
       int maxNum = n*n;
       int[][] ans = new int[n][n];
       int t=0; //top
       int b= n-1; //bottom
       int l = 0; //left
       int r = n-1; //rigth
       int k = 1;
       while(k <= maxNum){
            for(int i =l;i<=r;i++,k++) 
                ans[t][i] = k;
            t++;
            for(int i =t;i<=b;i++,k++) 
                ans[i][r] = k;
            r--;
            for(int i =r;i>=l;i--,k++) 
                ans[b][i] = k;
            b--;
            for(int i =b;i>=t;i--,k++) 
                ans[i][l] = k;
            l++;
       }
       return ans;
    }
}