Leetcode Spiral Matrix II

Given an integer n, generate a square matrix filled with elements from 1 to n² in spiral order.

For example,
Given n = 3,

You should return the following matrix:

[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

---

没啥特别方法，就是按照数字在矩阵中的顺序进行模拟，但要注意边界值的判断。

代码如下：

class Solution {
public:
    vector<vector<int>> generateMatrix(int n) {
        vector<vector<int>> result(n,vector<int>(n));  
        int count = 1;
        
        int rowbegin=0,colbegin=0;  
        int rowend=n-1,colend=n-1;  
          
        while(rowbegin <= rowend && colbegin <= colend)  
        {  
            for(int i=colbegin;i <= colend;i++)  
            {  
                result[rowbegin][i] = count++;  
            }  
            rowbegin++;  
              
            for(int i = rowbegin;i <= rowend;i++)  
            {  
                result[i][colend] = count++;  
            }  
            colend--;  
              
            if(rowbegin <= rowend)//经过前面语句会导致rowbegin>rowend  
            {  
                for(int i = colend;i>=colbegin;i--)  
                {  
                    result[rowend][i] = count++;  
                }  
                rowend--;  
            }  
              
            if(colbegin <= colend)//经过前面语句会导致colbegin>colend  
            {  
                for(int i = rowend;i>=rowbegin;i--)  
                {  
                    result[i][colbegin] = count++;  
                }  
                colbegin++;  
            }  
        }  
        return result;  
    }
};