Repository navigation
Expand file tree
/
Copy pathlc_59.cpp
More file actions
96 lines (89 loc) · 1.27 KB
/
Copy pathlc_59.cpp
File metadata and controls
96 lines (89 loc) · 1.27 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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
int row = n-1 ,col = n-1;
int r_s = 0, c_s = 0;
int i = 0;
vector<vector<int>> result(n);
for( i = 0; i < n; ++i)
{
result[i].resize(n);
}
int tra_i = 0, tra_j = 0;
int direct = 0;//0:right, 1: down, 2: left, 3: up
for( i = 1;i <= n*n;++i)
{
if( direct == 0 )//right
{
if( tra_j <= col )
{
result[tra_i][tra_j] = i;
++tra_j;
}
else
{
//--col;
++r_s;
++tra_i;
--tra_j;
direct = 1;
--i;
continue;
}
}
if( direct == 1)//down
{
if( tra_i <= row )
{
result[tra_i][tra_j] = i;
++tra_i;
}
else
{
//--row;
--col;
--tra_i;
--tra_j;
direct = 2;
--i;
continue;
}
}
if( direct == 2)//left
{
if( tra_j >= c_s )
{
result[tra_i][tra_j] = i;
--tra_j;
}
else
{
--row;
--tra_i;
++tra_j;
direct = 3;
--i;
continue;
}
}
if( direct == 3)//up
{
if( tra_i >= r_s)
{
result[tra_i][tra_j] = i;
--tra_i;
}
else
{
++c_s;
++tra_i;
++tra_j;
direct = 0;
--i;
continue;
}
}
}
return result;
}
};