LeetCode | Spiral Matrix /Spiral Matrix II

没有多大难度，用递归做，每次递归扫描一遍外层的元素
一相对要麻烦点，要注意矩阵的长宽

/******
* Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
*
* For example,
* Given the following matrix:
* [
* [ 1, 2, 3 ],
* [ 4, 5, 6 ],
* [ 7, 8, 9 ]
* ]
* You should return [1,2,3,6,9,8,7,4,5].
*
* last edited date：2015-10-13
* LeetCode Runtime : 0ms
* .cpp
*/
class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if (matrix.empty()) return vector<int>();
        vector<int> target;
        const int w = matrix.size();
        const int l = matrix[0].size();
        target.reserve(l*w);
        spiralPush(matrix, 0, l, w, target);
        return target;
    }
    void spiralPush(vector<vector<int>>& matrix, int i, int l,int w, vector<int> &target){
        if (l<1 || w <1){
            return;
        }
        else if (l == 1){
            int x = i;
            while (i < x + w)
            {
                target.push_back(matrix[i++][x]);
            }
            return;
        }
        else if (w == 1){
            int y = i;
            while (i < y + l)
            {
                target.push_back(matrix[y][i++]);
            }
            return;
        }
        else
        {
            int x = i, y = i;
            while (x < l + i - 1){
                target.push_back(matrix[y][x++]);
            }
            while (y < w + i - 1){
                target.push_back(matrix[y++][x]);
            }
            while (x > 0 + i){
                target.push_back(matrix[y][x--]);
            }
            while (y > 0 + i){
                target.push_back(matrix[y--][x]);
            }
            spiralPush(matrix, i + 1, l - 2, w - 2, target);
        }
    }
};

/*********
* 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 ]
* ]
*
* last edited date：2015-10-14
* LeetCode Runtime : 4ms
* .cpp
***/
class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        if (!n) return vector<vector<int>>();
        vector<vector<int>> matrix(n,vector<int>(n));
        spiralGenerate(matrix, n, 0, 1);
        return matrix;
    }
    void spiralGenerate(vector<vector<int>>& matrix, int l, int i, int value){
        if (l < 1) 
            return;
        else if 
            (l == 1) matrix[i][i] = value;
        else{
            int x = i, y = i;
            while (x < l + i - 1)
                matrix[y][x++] = value++;
            while (y < l + i - 1)
                matrix[y++][x] = value++;
            while (x > 0 + i)
                matrix[y][x--] = value++;
            while (y > 0 + i)
                matrix[y--][x] = value++;
            spiralGenerate(matrix, l - 2, i + 1, value);
        }
        return;
    }
};