-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathw2.q3
42 lines (42 loc) · 952 Bytes
/
w2.q3
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
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
vector<vector<int>> matrix(n,vector<int>(n,1));
int i,t,b,r,l,num=1;
t=0;
b=matrix[0].size()-1;
r=matrix.size()-1;
l=0;
while(t<=b &&l<=r)
{
for(i=t;i<=b;i++)
{
matrix[t][i]=num;
num++;
}
for(i=l+1;i<=r;i++)
{
matrix[i][r]=num;
num++;
}
if(t<b && l<r)
{
for(i=b-1;i>=t+1;i--)
{
matrix[b][i]=num;
num++;
}
for(i=r;i>=l+1;i--)
{
matrix[i][l]=num;
num++;
}
}
t++;
l++;
b--;
r--;
}
return matrix;
}
};