/
spiral-matrix-ii.cpp
59 lines (47 loc) · 1.19 KB
/
spiral-matrix-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
57
58
59
#include <vector>
using namespace std;
class Solution
{
public:
vector<vector<int> > generateMatrix(int n)
{
vector<vector<int> > matrix(n, vector<int>(n));
if (n == 0) {
return matrix;
}
int count = 0;
int num = 1;
while (true) {
if (count >= n - count) {
break;
}
for (int i = count; i < n - count; ++i) {
matrix[count][i] = num++;
}
if (n - count - 1 <= count - 1) {
break;
}
for (int i = count + 1; i < n - count; ++i) {
matrix[i][n - count - 1] = num++;
}
if (n - count - 1 <= count) {
break;
}
for (int i = n - count - 2; i >= count; --i) {
matrix[n - count - 1][i] = num++;
}
if (count >= n - count - 1) {
break;
}
for (int i = n - count - 2; i >= count + 1; --i) {
matrix[i][count] = num++;
}
count ++;
}
return matrix;
}
};
int main(int argc, char *argv[])
{
return 0;
}