class Solution {
public:
vector<vector<int> > generateMatrix(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int> > res(n, vector<int>(n));
if (n > 0)
{
int num = 1;
for (int level = 0; level < n / 2; ++level)
{
for (int i = level; i < n - level; ++i)
res[level][i] = num++;
for (int i = level + 1; i < n - level; ++i)
res[i][n - level - 1] = num++;
for (int i = n - level - 2; i >= level; --i)
res[n - level - 1][i] = num++;
for (int i = n - level - 2; i > level; --i)
res[i][level] = num++;
}
if (n % 2 == 1)
res[n / 2][n / 2] = num;
}
return res;
}
};[Leetcode] Spiral Matrix II
最新推荐文章于 2019-05-14 09:57:51 发布
本文介绍了一种使用C++编程语言实现生成矩阵的方法,通过类Solution中的generateMatrix函数,生成指定大小的矩阵并填充数字。
1147

被折叠的 条评论
为什么被折叠?



