-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy pathsolution059.cpp
More file actions
76 lines (65 loc) · 1.24 KB
/
solution059.cpp
File metadata and controls
76 lines (65 loc) · 1.24 KB
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/**
* Spiral Matrix II
*
* cpselvis([email protected])
* September 20th, 2016
*/
#include<iostream>
#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 rowBegin = 0, rowEnd = n - 1;
int colBegin = 0, colEnd = n - 1;
int k = 1;
while (rowBegin <= rowEnd && colBegin <= colEnd)
{
for (int i = colBegin; i <= colEnd; i ++)
{
matrix[rowBegin][i] = k ++;
}
rowBegin ++;
for (int i = rowBegin; i <= rowEnd; i ++)
{
matrix[i][colEnd] = k ++;
}
colEnd --;
if (rowBegin <= rowEnd)
{
for (int i = colEnd; i >= colBegin; i --)
{
matrix[rowEnd][i] = k ++;
}
rowEnd --;
}
if (colBegin <= colEnd)
{
for (int i = rowEnd; i >= rowBegin; i --)
{
matrix[i][colBegin] = k ++;
}
colBegin ++;
}
}
return matrix;
}
};
int main(int argc, char **argv)
{
Solution s;
vector<vector<int> > matrix = s.generateMatrix(3);
for (auto i : matrix)
{
for (auto j : i)
{
cout << j;
}
cout << endl;
}
}