输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例 1:
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:[1,2,3,6,9,8,7,4,5]
示例 2:
输入:matrix = [[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 int[] spiralOrder(int[][] matrix) {
//特判
if(matrix == null ||matrix.length == 0){
return new int[0];
}
//初始化
int left = 0, top = 0;
int right = matrix[0].length-1;
int bottom = matrix.length - 1;
int[] res = new int[(right+1)*(bottom+1)];
int k = 0;
//循环打印
while(top <= bottom && left <= right){
for(int i = left; i <= right; i++){ //从左到右
res[k++] = matrix[top][i];
}
top ++;
for(int i = top; i <= bottom; i++){ //从上到下
res[k++] = matrix[i][right];
}
right --;
for(int i = right; i >= left && top <= bottom; i--){ //从右到左
res[k++] = matrix[bottom][i];
}
bottom --;
for(int i = bottom; i >= top && left <= right; i--){ //从下到上
res[k++] = matrix[i][left];
}
left ++;
}
return res;
}
}