剑指 Offer 29. 顺时针打印矩阵
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例 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]
限制:
0 <= matrix.length <= 100
0 <= matrix[i].length <= 100
题解
暴力解决
class Solution {
public int[] spiralOrder(int[][] matrix) {
if(matrix.length == 0)
return new int[0];
int row = matrix.length,col = matrix[0].length;
int[] ans = new int[row * col];
int k = 0;
int l =0,r = col -1,t =0,b = row -1;
while(k < col * row){
for(int i=l;i<=r;i++)
ans[k++] = matrix[t][i];
t++;
for(int i=t;i<=b;i++)
ans[k++] = matrix[i][r];
r--;
for(int i=r;i>=l && t <= b;i--)
ans[k++] = matrix[b][i];
b--;
for(int i=b;i>=t && l <= r;i--)
ans[k++] = matrix[i][l];
l++;
}
return ans;
}
}