-
Notifications
You must be signed in to change notification settings - Fork 13
/
SpiralOrder29.java
49 lines (46 loc) · 1.09 KB
/
SpiralOrder29.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
44
45
46
47
48
49
package Leetcode;
public class SpiralOrder29 {
/* Method: Traversal by layer , Time: O(M*N), Space:O(1)**/
public int[] spiralOrder(int[][] matrix) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return new int[0];
}
int[] res = new int[matrix[0].length * matrix.length ];
int left = 0;
int right = matrix[0].length - 1;
int up = 0;
int down = matrix.length - 1;
int index = 0;
while(true) {
for(int col = left; col <= right; col ++) {
res[index++] =matrix[up][col];
}
up++;
if(up>down) {
break;
}
for(int row = up; row <= down; row ++) {
res[index++] =matrix[row][right];
}
right--;
if(right<left) {
break;
}
for(int col = right; col >= left; col -- ) {
res[index++] = matrix[down][col];
}
down--;
if(down < up) {
break;
}
for(int row = down; row >= up; row --) {
res[index++] = matrix[row][left];
}
left++;
if(left>right) {
break;
}
}
return res;
}
}