leetcode -- Spiral Matrix II

https://oj.leetcode.com/problems/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 ]
]

public int[][] generateMatrix(int n)

这题其实本质上和http://blog.csdn.net/chaochen1407/article/details/43272109 Spiral Matrix是一个做法，只是前者是在绕圈的时候读数，这里是在绕圈的时候放数字，放数字的过程其实用一个计数器counter就可以了。具体就不重复阐述了。看代码吧：

    public int[][] generateMatrix(int n) {
        int[][] res = new int[n][n];
        int left = 0, right = n - 1, bot = 0, top = n - 1;
        int counter = 1;
        while(true){
            int curleft = left;
            while(curleft <= right){
                res[bot][curleft] = counter;
                counter++;
                curleft++;
            }
            bot++;
            if(bot > top)
                break;
            int curbot = bot;
            while(curbot <= top){
                res[curbot][right] = counter;
                counter++;
                curbot++;
            }
            right--;
            if(left > right)
                break;
            int curright = right;
            while(left <= curright){
                res[top][curright] = counter;
                counter++;
                curright--;
            }
            top--;
            if(bot > top)
                break;
            int curtop = top;
            while(curtop >= bot){
                res[curtop][left] = counter;
                counter++;
                curtop--;
            }
            left++;
            if(left > right)
                break;
        }
        return res;
    }