-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSpiral Matrix.java
43 lines (41 loc) · 1004 Bytes
/
Spiral Matrix.java
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
class Solution {
public List<Integer> spiralOrder(int[][] arr) {
List<Integer>l=new ArrayList();
int row=arr.length;
int col=arr[0].length;
int left=0;
int top=0;
int bottom=row-1;
int right=col-1;
while(left<=right && top<=bottom)
{
for(int i=left;i<=right;i++)
{
l.add(arr[top][i]);
}
top++;
for(int i=top;i<=bottom;i++)
{
l.add(arr[i][right]);
}
right--;
if(top<=bottom)
{
for(int i=right;i>=left;i--)
{
l.add(arr[bottom][i]);
}
bottom--;
}
if(left<=right)
{
for(int i=bottom;i>=top;i--)
{
l.add(arr[i][left]);
}
left++;
}
}
return l;
}
}