[leet code] Spiral Matrix II

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

For example,
Given n = 3,

You should return the following matrix:

[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

============

Analysis:

Idea of this problem is similar to [leet code] Rotate Image, which is to construct the target matrix "layer" by "layer".  Demonstration of "layer" can be referred to problem Rotate Image.

In this problem, each layer is formed with 4 components in order of top->right->bottom->left.  And each component has its own format logic.  These logics can be found out by manually try some examples.  In my case, I tried n=4 (in detail) and n=5(verify the logic got from n=4) to find out all the logics.

public class Solution {
    public int[][] generateMatrix(int n) {
        int[][] rs = new int[n][n];
        if(n == 1) {
            rs[0][0] = 1;
            return rs;
        }
        
        int k = 1;
        
        for(int i=0; i<n/2; i++){ //layers
            // top
            for(int j=i; j<n-1-i; j++){
                rs[i][j] = k;
                k++;
            }
            // right
            for(int j=i; j<n-1-i; j++){
                rs[j][n-1-i] = k;
                k++;
            }
            // bottom
            for(int j=n-1-i; j>i; j--){
                rs[n-1-i][j] = k;
                k++;
            }
            // left
            for(int j=n-1-i; j>i; j--){
                rs[j][i] = k;
                k++;
            }
        }
        if(n%2 != 0) rs[n/2][n/2] = k; // the centre element
        
        return rs;
    }
}