题目
给定一个包含 m x n 个元素的矩阵(m 行, n 列),请按照顺时针螺旋顺序,返回矩阵中的所有元素。
示例 1:
输入: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] 输出: [1,2,3,6,9,8,7,4,5]
示例 2:
输入: [ [1, 2, 3, 4], [5, 6, 7, 8], [9,10,11,12] ] 输出: [1,2,3,4,8,12,11,10,9,5,6,7]
解法
class Solution {
public List<Integer> spiralOrder(int[][] matrix) {
List<Integer> list = new ArrayList<>();
if(matrix.length == 0 || matrix[0].length == 0){
return list;
}
if(matrix[0].length == 1){
for(int i = 0; i< matrix.length; i++){
list.add(matrix[i][0]);
}
return list;
}
list.add(matrix[0][0]);
top(list, matrix, 0,0);
return list;
}
//从左往右
public void top(List<Integer> list, int[][] matrix, int m, int n){
if(n + 1 == matrix[0].length - m ){
return;
}
for(int x = n + 1; x < matrix[0].length - m; x++){
list.add(matrix[m][x]);
}
right(list, matrix, m, matrix[0].length - m - 1);
}
//从上往下
public void right(List<Integer> list, int[][] matrix, int m, int n){
if(m + 1 == matrix.length - m){
return;
}
for(int x = m + 1; x < matrix.length - m; x++){
list.add(matrix[x][n]);
}
bottom(list, matrix,matrix.length - m -1, n);
}
//从右往左
public void bottom(List<Integer> list, int[][] matrix, int m, int n){
if(n == matrix[0].length - n-1){
return;
}
for(int x = n - 1; x >= matrix[0].length - n - 1; x--){
list.add(matrix[m][x]);
}
left(list, matrix, m, matrix[0].length - n - 1);
}
//从下往上
public void left(List<Integer> list, int[][] matrix, int m, int n){
if(m == matrix.length - m){
return;
}
for(int x = m - 1; x >= matrix.length - m; x--){
list.add(matrix[x][n]);
}
top(list, matrix, matrix.length - m, n);
}
}