forked from codemistic/Data-Structures-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMatrixTraversing.cpp
82 lines (65 loc) · 1.36 KB
/
MatrixTraversing.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
78
79
80
81
82
#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)
{
// code hereint rs = 0;
vector<int> v;
int cs = 0;
int rs = 0;
int re = r-1;
int ce = c-1;
while(rs<=re || cs<=ce){
if(rs<=re){
for(int col = cs;col<=ce;col++){
v.push_back(matrix[rs][col]);
}}
rs++;
if(cs<=ce){
for(int row = rs;row <=re;row++){
v.push_back(matrix[row][ce]);
}}
ce--;
if(rs<=re){
for(int col = ce;col>=cs;col--){
v.push_back(matrix[re][col]);
}
}
re--;
if(cs<=ce){
for(int row = re;row>=rs;row--){
v.push_back(matrix[row][cs]);
}
}
cs++;
}
return v;
}
};
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;
}