leetcode 59. 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 ]
]

---

这道题比spiral matrix要简单，因为是方阵，不需要判断越界情况，整体思路还是一样，实现四个函数，对应四条边的遍历

public class Solution {
    public int[][] generateMatrix(int n) {
        int num = n*n;
        int [][]res = new int[n][n];
        int a=1;
        int s = 0;
        while(a<=num){
            for(int i=s;i<n;i++){
                res[s][i]=a;
                a++;
            }
            for(int i=s+1;i<n;i++){
                res[i][n-1]=a;
                a++;
            }
            for(int i=n-2;i>=s;i--){
                res[n-1][i]=a;
                a++;
            }
            for(int i=n-2;i>s;i--){
                res[i][s]=a;
                a++;
            }
            s++;
            n--;
        }
        return res;
    }
}