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 ]
]

Have you been asked this question in an interview? 

自己的这种写法不够简化。
这种方法要考虑到的几个问题：
n<0
n=1
以及对于while 循环里的这几种写法，导致要单独考虑n 为基数时，最中心只有一个元素的情况

public class Solution {
    public int[][] generateMatrix(int n) {
        if (n < 0) {
            return null;
        }
        
        int[][] res = new int[n][n];
        if (n == 1) {
            res[0][0] = 1;
            return res;
        }
        int num = 1;
        int layers = n/2;
        int layer = 0;
        while(layer < layers) {
            int start = layer;
            int end = n -1 - layer;
            for (int j = start; j < end; j++) {
                res[start][j] = num;
                num++;
            }
            for (int j = start; j < end; j++) {
                res[j][end] = num;
                num++;
            }
            for (int j = end; j > start; j--) {
                res[end][j] = num;
                num++;
            }
            for (int j = end; j > start; j--) {
                res[j][start] = num;
                num++;
            }
            layer++;
        }
        if (n % 2 != 0) {
            res[n / 2][n / 2] = num;
        }
        return res;
    }
}

较好一些的：
n <0;
n = 1;
以上两种情况依旧要单独考虑
但是不再需要去处理中心只有一个元素的情况

public class Solution {
    public int[][] generateMatrix(int n) {
        if (n < 0) {
            return null;
        }

        int[][] result = new int[n][n];

        int xStart = 0;
        int yStart = 0;
        int num = 1;

        while (n > 0) {
            if (n == 1) {
                result[yStart][xStart] = num++;
                break;
            }

            for (int i = 0; i < n - 1; i++) {
                result[yStart][xStart + i] = num++;
            }

            for (int i = 0; i < n - 1; i++) {
                result[yStart + i][xStart + n - 1] = num++;
            }

            for (int i = 0; i < n - 1; i++) {
                result[yStart + n - 1][xStart + n - 1 - i] = num++;
            }

            for (int i = 0; i < n - 1; i++) {
                result[yStart + n - 1 - i][xStart] = num++;
            }

            xStart++;
            yStart++;
            n = n - 2;
        }

        return result;
    }
}

刷第二遍，写完spiral matrix 再写ii的时候， ii 完全可以套用1 的模版

这里主要注意的是 while 循环里 是 top <= bottom, 所以可能存在top ==bottom 的情况，这时候要break

public class Solution {
    public int[][] generateMatrix(int n) {
        if (n < 0) {
            return null;
        }
        int[][] result = new int[n][n];
        int top = 0;
        int bottom = n - 1;
        int value = 1;
        while (top <= bottom ) {
            for (int i = top; i <= bottom; i++) {
                result[top][i] = value;
                value++;
            }
            for (int i = top + 1; i <= bottom; i++) {
                result[i][bottom] = value;
                value++;
            }
            if (top == bottom) {
                break;
            }
            for (int i = bottom - 1; i >= top; i--) {
                result[bottom][i] = value;
                value++;
            }
            for (int i = bottom - 1; i > top; i--) {
                result[i][top] = value;
                value++;
            }
            top++;
            bottom--;
        }
        return result;
    }
}