给定一个包含 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]
思路:
写了4个函数相互递归,访问过的地方就标记一下
class Solution {
boolean[][] is;
public List<Integer> spiralOrder(int[][] matrix) {
List<Integer> list = new ArrayList<>();
if(matrix.length<1 || matrix[0].length<1)
return list;
int m=matrix.length,n=matrix[0].length;
is = new boolean[m][n];
Right(matrix,0,0,list);
return list;
}
private void Right(int[][] matrix, int i, int j, List<Integer> list) {
int m=matrix.length,n=matrix[0].length;
while(j<n && !is[i][j])
{
is[i][j] = true;
list.add(matrix[i][j++]);
}
j--;
if(i+1<m && !is[i+1][j])
Down(matrix,i+1,j,list);
}
private void Down(int[][] matrix, int i, int j, List<Integer> list) {
int m=matrix.length,n=matrix[0].length;
while(i<m && !is[i][j])
{
is[i][j] = true;
list.add(matrix[i++][j]);
}
i--;
if(j-1>=0 && !is[i][j-1])
Left(matrix,i,j-1,list);
}
private void Left(int[][] matrix, int i, int j, List<Integer> list) {
int m=matrix.length,n=matrix[0].length;
while(j>=0 && !is[i][j])
{
is[i][j] = true;
list.add(matrix[i][j--]);
}
j++;
if(i-1>=0 && !is[i-1][j])
Up(matrix,i-1,j,list);
}
private void Up(int[][] matrix, int i, int j, List<Integer> list) {
int m=matrix.length,n=matrix[0].length;
while(i>=0 && !is[i][j])
{
is[i][j] = true;
list.add(matrix[i--][j]);
}
i++;
if(j+1<n && !is[i][j+1])
Right(matrix,i,j+1,list);
}
}