输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例 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 rowlength = matrix.length,collength = matrix[0].length;
int arrs[] = new int[rowlength*collength];
int up=0,down=rowlength-1,left=0,right=collength-1;
int i=up,j=left,num=0;
while(up<=down&&left<=right){
while(j<=right&&up<=down&&left<=right){
arrs[num++]=matrix[i][j++];
}
i++;j--;up++;
while(i<=down&&up<=down&&left<=right){
arrs[num++]=matrix[i++][j];
}
j--;i--;right--;
while(j>=left&&up<=down&&left<=right){
arrs[num++]=matrix[i][j--];
}
i--;j++;down--;
while(i>=up&&up<=down&&left<=right){
arrs[num++]=matrix[i--][j];
}
j++;i++;left++;
}
return arrs;
}
}
时间复杂度为O(mn),空间复杂度O(1),但前两次小循环也就是up和right的循环后显然不会造成横向或者纵向的指针交叉。所以前两步的循环判断是多余的。
- 改进
class Solution {
public int[] spiralOrder(int[][] matrix) {
if(matrix.length==0) return new int[0];
int rowlength = matrix.length,collength = matrix[0].length;
int arrs[] = new int[rowlength*collength];
int up=0,down=rowlength-1,left=0,right=collength-1;
int i=up,j=left,num=0;
while(up<=down&&left<=right){
while(j<=right){
arrs[num++]=matrix[i][j++];
}
i++;j--;up++;
while(i<=down){
arrs[num++]=matrix[i++][j];
}
j--;i--;right--;
if(up<=down&&left<=right){
while(j>=left){
arrs[num++]=matrix[i][j--];
}
i--;j++;down--;
while(i>=up){
arrs[num++]=matrix[i--][j];
}
j++;i++;left++;
}
}
return arrs;
}
}
复杂度都是O(mn),但改进后的时间优化了许多。