-
Notifications
You must be signed in to change notification settings - Fork 0
/
Print the matrix in spiral manner
46 lines (34 loc) · 1.19 KB
/
Print the matrix in spiral manner
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
class Solution {
public List<Integer> spiralOrder(int[][] mat)
{
List<Integer> ans = new ArrayList<>();
int n = mat.length; // no. of rows
int m = mat[0].length; // no. of columns
// Initialize the pointers required for traversal.
int top = 0, left = 0, bottom = n - 1, right = m - 1;
// Loop until all elements are not traversed.
while (top <= bottom && left <= right) {
// For moving left to right
for (int i = left; i <= right; i++)
ans.add(mat[top][i]);
top++;
// For moving top to bottom.
for (int i = top; i <= bottom; i++)
ans.add(mat[i][right]);
right--;
// For moving right to left.
if (top <= bottom) {
for (int i = right; i >= left; i--)
ans.add(mat[bottom][i]);
bottom--;
}
// For moving bottom to top.
if (left <= right) {
for (int i = bottom; i >= top; i--)
ans.add(mat[i][left]);
left++;
}
}
return ans;
}
}