顺时针打印矩阵

题目描述：

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下矩阵： 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 （4X4矩阵） 则依次打印出数字1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10.

懒得描述了，直接上代码了。

import java.util.ArrayList;

public class Main5 {
public static ArrayList<Integer> printMatrix(int[][] matrix) {
ArrayList<Integer> list = new ArrayList<Integer>();
for (int row = 0, col = 0, rlen = matrix.length, clen = matrix[0].length; rlen > 0
&& clen > 0; rlen -= 2, clen -= 2, row++, col++) {
store(row, col, rlen, clen, list, matrix);
}
return list;
}

public static ArrayList<Integer> store(int row, int col, int rlen, int clen, ArrayList<Integer> list,
int[][] matrix) {
for (int i = col; i < clen + col; i++) {// 从左到右
list.add(matrix[row][i]);
}
for (int i = row + 1; i < rlen + row; i++) {// 从上到下
list.add(matrix[i][col + clen - 1]);
}
for (int i = col + clen - 2; (i >= col) && (rlen > 1); i--) {// 从右到左
list.add(matrix
4000
[row + rlen - 1][i]);
}
for (int i = row + rlen - 2; (i >= row + 1) && (clen > 1); i--) {// 从下到上
list.add(matrix[i][col]);
}

return list;
}

public static void main(String[] args) {
int[][] matrix = { { 1,2,3,4}, { 5,6,7,8}, {9,10,11,12}, {13,14,15,16}};
System.out.println(printMatrix(matrix));

}

}