Problem
leetcode链接problem
题目实际上是一个模拟的过程,模拟的过程不是很难。
Code
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> res(n, vector<int>(n, 0));
int t = 0;int b = n - 1;int l = 0;int r = n - 1;int i = 0;
while (i < n * n)
{
for (int j = l; j <= r; j++)
{
res[t][j] = ++i;
}
t++;
for (int j = t; j <= b; j++)
{
res[j][r] = ++i;
}
r--;
for (int j = r; j >= l; j--)
{
res[b][j] = ++i;
}
b--;
for (int j = b; j >= t; j--)
{
res[j][l] = ++i;
}
l++;
}
return res;
}
};