题目
给你一个 m 行 n 列的矩阵 matrix ,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。
示例 1:
示例 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]
提示:
m == matrix.length
n == matrix[i].length
1 <= m, n <= 10
-100 <= matrix[i][j] <= 100
代码
class Solution {
public List<Integer> spiralOrder(int[][] matrix) {
int left = 0, right = matrix[0].length - 1, up = 0, down = matrix.length - 1;
int numEle = matrix.length * matrix[0].length;
List<Integer> res = new ArrayList<>();
while (numEle >= 1) {
for (int i = left; i <= right && numEle >= 1; i++) {
res.add(matrix[up][i]);
numEle--;
}
up++;
for (int i = up; i <= down && numEle >= 1; i++) {
res.add(matrix[i][right]);
numEle--;
}
right--;
for (int i = right; i >= left && numEle >= 1; i--) {
res.add(matrix[down][i]);
numEle--;
}
down--;
for (int i = down; i >= up && numEle >= 1; i--) {
res.add(matrix[i][left]);
numEle--;
}
left++;
}
return res;
}
}