54. 螺旋矩阵
给你一个 m 行 n 列的矩阵 matrix ,请按照 顺时针螺旋顺序 ,返回矩阵中的所有元素。
示例 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 static List<Integer> spiralOrder(int[][] matrix) {
ArrayList<Integer> list = new ArrayList<>();
int k = 0;
int up = 0, down = matrix.length - 1, left = 0, right = matrix[0].length - 1;
while (up <= down && left <= right) {
//保持左闭右闭
//从左到右,up向下移动一行
for (int i = left; i <= right; i++) {
list.add(matrix[up][i]);
}
up++;
//从上到下,right向左移动一列
for (int i = up; i <= down; i++) {
list.add(matrix[i][right]);
}
right--;
//从右到左,down向上移动一行, && up <= down考虑最后一行情形
for (int i = right; i >= left && up <= down; i--) {
list.add(matrix[down][i]);
}
down--;
//从下到上,left向右移动一列,&& left <= right考虑最后一行情形
for (int i = down; i >= up && left <= right; i--) {
list.add(matrix[i][left]);
}
left++;
}
return list;
}
}
key:
1.从右到左,down向上移动一行, && up <= down考虑最后一行情形
2.从下到上,left向右移动一列,&& left <= right考虑最后一行情形