题目:
给定一个包含 m x n 个元素的矩阵(m 行, n 列),请按照顺时针螺旋顺序,返回矩阵中的所有元素。
示例 1:
输入: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] 输出: [1,2,3,6,9,8,7,4,5]
示例 2:
输入: [ [1, 2, 3, 4], [5, 6, 7, 8], [9,10,11,12] ] 输出: [1,2,3,4,8,12,11,10,9,5,6,7]
从(0,0)往右走,如果下一格已经越界或已经访问过就按顺时针顺序换个方向
class Solution {
public List<Integer> spiralOrder(int[][] matrix) {
List<Integer> list = new ArrayList<>();
if(matrix == null || matrix.length == 0)
return list;
int rows = matrix.length;
int cols = matrix[0].length;
boolean[][] visited = new boolean[rows][cols];
int[] dx = new int[]{-1,0,1,0};
int[] dy = new int[]{0, 1,0,-1};
int x = 0, y = 0, d = 1;
for(int i = 0; i < rows*cols; i++){
list.add(matrix[x][y]);
visited[x][y] = true;
int a = x + dx[d], b = y + dy[d];
if(a <0 || a>=rows||b<0||b>=cols||visited[a][b]){
d = (d+1)%4;
a = x + dx[d];
b = y + dy[d];
}
x = a;
y = b;
}
return list;
}
}