-
Notifications
You must be signed in to change notification settings - Fork 0
/
59.螺旋矩阵-ii.cpp
56 lines (55 loc) · 1.15 KB
/
59.螺旋矩阵-ii.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <vector>
#include <algorithm>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
using namespace std;
/*
* @lc app=leetcode.cn id=59 lang=cpp
*
* [59] 螺旋矩阵 II
*/
// @lc code=start
class Solution
{
public:
vector<vector<int>> generateMatrix(int n)
{
vector<vector<int>> reslut(n, vector(n, 0));
int l = 0, r = n - 1, t = 0, b = n - 1, count = 1;
while (count <= n * n)
{
for (int j = l; j <= r; ++j)
{
reslut[t][j] = count;
++count;
}
++t;
for (int j = t; j <= b; ++j)
{
reslut[j][r] = count;
++count;
}
--r;
for (int j = r; j >= l; --j)
{
reslut[b][j] = count;
++count;
}
--b;
for (int j = b; j >= t; --j)
{
reslut[j][l] = count;
++count;
}
++l;
}
return reslut;
}
};
// @lc code=end