-
Notifications
You must be signed in to change notification settings - Fork 72
/
Spirally traversing a matrix
69 lines (63 loc) · 1.53 KB
/
Spirally traversing a matrix
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
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
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)
{
vector<int>v;
int sr=0,sc=0,er=r-1,ec=c-1;
while(sr<=er && sc<=ec)
{
for(int i=sc;i<=ec;i++)
v.push_back(matrix[sr][i]);
sr++;
if(sr<=er && sc<=ec)
{
for(int i=sr;i<=er;i++)
v.push_back(matrix[i][ec]);
ec--;
}
if(sr<=er && sc<=ec)
{
for(int i=ec;i>=sc;i--)
v.push_back(matrix[er][i]);
er--;
}
if(sr<=er && sc<=ec)
{
for(int i=er;i>=sr;i--)
v.push_back(matrix[i][sc]);
sc++;
}
}
return v;
}
};
// { Driver Code Starts.
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;
} // } Driver Code Ends