题目描述:输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下矩阵: 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.
思路:呈环形打印矩阵,注意行矩阵和列矩阵的情况
public ArrayList<Integer> printMatrix(int [][] matrix) {
if(matrix == null || matrix.length == 0 || matrix[0].length == 0){
return null;
}
ArrayList<Integer> arrayList = new ArrayList<Integer>();
int left = 0;
int top = 0;
int right = matrix[0].length - 1;
int bottom = matrix.length - 1;
while(left <= right && top <= bottom){
for(int i = left; i <= right; i++){
arrayList.add(matrix[top][i]);
}
for(int i = top + 1; i <= bottom; i++){
arrayList.add(matrix[i][right]);
}
//逆向
if(top != bottom){
for(int i = right - 1; i >= left; i--){
arrayList.add(matrix[bottom][i]);
}
}
//逆向
if(left != right){
for(int i = bottom - 1; i >= top + 1; i--){
arrayList.add(matrix[i][left]);
}
}
left++; top++; right--; bottom--;
}
return arrayList;
}