题目
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
For example,
Given the following matrix:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
You should return [1,2,3,6,9,8,7,4,5].
分析
原来看到这种题,我一定会循环。记录各个边界点,然后循环,直到最后几个边界重合。
现在,我选择godie,递归。
这道题,我曾经见过的。
public static List<Integer> spiralOrder(int[][] matrix) {
List<Integer> ret = new ArrayList<>(matrix.length*matrix.length);
if(matrix.length==0 ||matrix[0].length==0) {
return ret;
}
reSpiralOrder(ret, matrix, 0,0,matrix.length , matrix[0].length);
return ret;
}
public static List<Integer> reSpiralOrder(List<Integer> ret, int[][] matrix, int x, int y, int m, int n) {
if (m<=0||n<=0) {
return ret;
}
for (int i = x, j = y ; j < n+y;j++){
ret.add(matrix[i][j]);
}
for (int i = x+1, j = y+n-1; i< m+x;i++) {
ret.add(matrix[i][j]);
}
if (m>1) {
for (int i = m+x-1, j = y+n-2; j>=x;j--) {
ret.add(matrix[i][j]);
}
if (n>1) {
for (int i = m+x-2, j = x; i>x;i--) {
ret.add(matrix[i][j]);
}
}
}
reSpiralOrder(ret, matrix, x+1, y+1, m-2, n-2);
return ret;
}