题目描述
给你一个 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/spiral-matrix
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路
class Solution {
public List<Integer> spiralOrder(int[][] matrix) {
List<Integer> res = new ArrayList<>();
int left = 0,right = matrix[0].length-1,up = 0,down = matrix.length-1;
while(left <= right && up <= down){
for(int col = left;col <= right;++col){
res.add(matrix[up][col]);
}
for(int row = up+1;row <= down;++row){
res.add(matrix[row][right]);
}
if(left < right && up < down){
for(int col = right-1;col >= left;--col){
res.add(matrix[down][col]);
}
for(int row = down-1;row > up;--row){
res.add(matrix[row][left]);
}
}
left++;
right--;
up++;
down--;
}
return res;
}
}