螺旋矩阵
题目
https://leetcode.cn/problems/spiral-matrix/
给你一个 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 List<Integer> spiralOrder(int[][] matrix) {
int top=0;
int down=matrix.length-1;
int left=0;
int reght=matrix[0].length-1;
List<Integer> sum = new ArrayList();
for(;top<=down&&left<=reght;){
for(int i=left;i<=reght;i++){
sum.add(matrix[top][i]);
}
top++;
for(int j=top;j<=down;j++){
sum.add(matrix[j][reght]);
}
reght--;
if(top<=down){
for(int i=reght;i>=left;i--){
sum.add(matrix[down][i]);
}
}
down--;
if(left<=reght){
for(int j=down;j>=top;j--){
sum.add(matrix[j][left]);
}
}
left++;
}
return sum;
}
}