-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathspiral_traversing_of_matrix.cpp
39 lines (36 loc) · 1.14 KB
/
spiral_traversing_of_matrix.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
// problem link: https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1
vector<int> spirallyTraverse(vector<vector<int> > matrix, int r, int c)
{
int top=0, bottom=r-1, left=0, right=c-1;
vector <int> v;
while(top <= bottom && left <= right)
{
for(int i=left; i<=right; i++) // for top row
{
v.push_back(matrix[top][i]);
}
top++;
for(int i=top; i<=bottom; i++) // for right column
{
v.push_back(matrix[i][right]);
}
right--;
if(top <= bottom)
{
for(int i=right; i>=left; i--) // for bottom row
{
v.push_back(matrix[bottom][i]);
}
bottom--;
}
if(left <= right)
{
for(int i=bottom; i>=top; i--) // for left column
{
v.push_back(matrix[i][left]);
}
left++;
}
}
return v;
}