题目
给你一个 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) {
ArrayList<Integer> list = new ArrayList<>();
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return list;
}
int row=matrix.length;
int column=matrix[0].length;
int left=0;
int right=column-1;
int top=0;
int bottom=row-1;
int sum=row*column;
while (sum>=1)
{
for (int i = left; i <=right&&sum>=1; i++) {
list.add(matrix[top][i]);
sum--;
}
top++;
for (int i = top; i <=bottom&&sum>=1 ; i++) {
list.add(matrix[i][right]);
sum--;
}
right--;
for (int i = right; i >=left&&sum>=1 ; i--) {
list.add(matrix[bottom][i]);
sum--;
}
bottom--;
for (int i = bottom; i >=top&&sum>=1; i--) {
list.add(matrix[i][left]);
sum--;
}
left++;
}
return list;
}
}