-
Notifications
You must be signed in to change notification settings - Fork 0
/
SpirallyTraversingMatrix.cpp
77 lines (71 loc) · 1.66 KB
/
SpirallyTraversingMatrix.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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <bits/stdc++.h>
using namespace std;
class Solution
{
public:
//Function to return a list of integers denoting spiral traversal of matrix.
vector<int> spirallyTraverse(vector<vector<int>> matrix, int r, int c)
{
int top,bottom,left,right,dir;
top=0;
bottom=r-1;
left=0;
right=c-1;
dir=0;
int i;
vector<int> ans;
while(top<=bottom && left<=right)
{
if(dir==0)
{
for(i=left;i<=right;i++)
ans.push_back(matrix[top][i]);
top++;
}
else if(dir==1)
{
for(i=top;i<=bottom;i++)
ans.push_back(matrix[i][right]);
right--;
}
else if(dir==2)
{
for(i=right;i>=left;i--)
ans.push_back(matrix[bottom][i]);
bottom--;
}
else if(dir==3)
{
for(i=bottom;i>=top;i--)
ans.push_back(matrix[i][left]);
left++;
}
dir=(dir+1)%4;
}
return ans;
}
};
int main() {
int t;
cin>>t;
while(t--)
{
int r,c;
cin>>r>>c;
vector<vector<int> > matrix(r);
for(int i=0; i<r; i++)
{
matrix[i].assign(c, 0);
for( int j=0; j<c; j++)
{
cin>>matrix[i][j];
}
}
Solution ob;
vector<int> result = ob.spirallyTraverse(matrix, r, c);
for (int i = 0; i < result.size(); ++i)
cout<<result[i]<<" ";
cout<<endl;
}
return 0;
}