描述
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下4 X 4矩阵:
[[1,2,3,4],
[5,6,7,8],
[9,10,11,12],
[13,14,15,16]]
则依次打印出数字
[1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10]
示例1
输入: [[1,2],[3,4]]
返回值: [1,2,4,3]
代码:
import java.util.ArrayList;
public class Solution {
public ArrayList<Integer> printMatrix(int [][] matrix) {
ArrayList<Integer> list = new ArrayList<>();
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return list;
}
int row = matrix.length;
int col = matrix[0].length;
int start = 0; //每一圈的起始坐标(start,start)
//对于5x5矩阵而言,最内圈起始坐标为(2,2) 5>2*2成立
//对于6x6矩阵而言,最内圈起始坐标为(2,2) 6>2*2仍成立
while(col > start*2 && row > start*2) {
printMatrix(matrix, col, row, start, list);
start++;
}
return list;
}
//打印一圈
public void printMatrix(int [][] matrix, int col, int row, int start, ArrayList<Integer> list) {
int endx = col - 1 - start;
int endy = row - 1 - start;
//从左到右打印一行
for (int i = start; i <= endx; ++i) {
list.add(matrix[start][i]);
}
//从上到下打印一列 起始行号小于终止行号(至少两行)
if (start < endy) {
for (int i = start+1; i <= endy; ++i) {
list.add(matrix[i][endx]);
}
}
//从右到左打印一行 起始行号小于终止行号 起始列号小于终止列号(至少两行两列)
if (start < endx && start < endy) {
for (int i = endx-1; i >= start; --i) {
list.add(matrix[endy][i]);
}
}
//从下到上打印一列 (至少三行两列)
if (start < endx && start < endy-1) {
for (int i = endy-1; i >= start+1; --i) {
list.add(matrix[i][start]);
}
}
}
}