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

题意很简单，螺旋填数。做法：递归.

1.每次只处理最外面一圈的数，以此，上右下左，然后递归。

2.递归出口是当所需处理的矩形大小为0(n为偶数)或者为1(n为奇数)时

class Solution {
public:
    void getMatrix(vector<vector<int>> &mat,int xPos,int yPos,int startNum,int matSize)
    {
        if(matSize<=0)
                return;
        if(matSize==1)
        {
                mat[xPos][yPos]=startNum;
                return;
        }
        for(int i=yPos;i<yPos+matSize-1;i++)
                mat[xPos][i]=startNum++;
        for(int i=xPos;i<xPos+matSize-1;i++)
                mat[i][yPos+matSize-1]=startNum++;
        for(int i=yPos+matSize-1;i>xPos;i--)
                mat[xPos+matSize-1][i]=startNum++;
        for(int i=xPos+matSize-1;i>yPos;i--)
                mat[i][yPos]=startNum++;
        getMatrix(mat,xPos+1,yPos+1,startNum,matSize-2);
    }

    vector<vector<int>> generateMatrix(int n) 
    {
        vector<vector<int>> res;
        for(int i = 0; i < n; i++)
        {  
                vector<int> temp(n, 0);
                res.push_back(temp);
        }
        getMatrix(res,0,0,1,n);
        return res;
    }
};