https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例 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==null||matrix.length==0||matrix[0].length==0){
return new int[0];
}
//rows为行起点,rowe为行终点
int rows=0,rowe=matrix.length-1;
//cols为列起点,cole为列终点
int cols=0,cole=matrix[0].length-1;
int[] res=new int[matrix.length*matrix[0].length];
List<Integer> list=new ArrayList<Integer>();
while(rows<=rowe||cols<=cole){
//判断当前rows是否还有效
if(rows<=rowe){
for(int i=cols;i<=cole;i++){
list.add(matrix[rows][i]);
}
rows++;
}
//判断当前cole是否还有效
if(cole>=cols){
for(int i=rows;i<=rowe;i++){
list.add(matrix[i][cole]);
}
cole--;
}
//判断当前rowe是否还有效
if(rowe>=rows){
for(int i=cole;i>=cols;i--){
list.add(matrix[rowe][i]);
}
rowe--;
}
//判断当前cols是否还有效
if(cols<=cole){
for(int i=rowe;i>=rows;i--){
list.add(matrix[i][cols]);
}
cols++;
}
}
for(int i=0;i<list.size();i++){
res[i]=list.get(i);
}
return res;
}
}