题目描述:
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下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.
解题思路:
通过逐渐缩小矩阵的边界来遍历矩阵达到顺时针打印矩阵的效果。给出四个变量:up,down,left,right,每次向右遍历,遍历一行后,给up++,向左遍历,遍历一行后,给down--,以此类推,直到up==down或left==right的时候为止。
代码:
import java.util.ArrayList;
public class Solution {
public static ArrayList<Integer> printMatrix(int [][] matrix) {
ArrayList<Integer> list = new ArrayList<>();
if(matrix==null || matrix.length==0){
return list;
}
int up = 0, down = matrix.length-1, left = 0, right = matrix[0].length-1;
while(true){
int tmp = left;
//向右遍历
while(tmp <= right){
list.add(matrix[up][tmp]);
tmp++;
}
up++;
if(up > down){
break;
}
//向下遍历
tmp = up;
while(tmp <= down){
list.add(matrix[tmp][right]);
tmp++;
}
right--;
if(right < left){
break;
}
//向左遍历
tmp = right;
while(tmp >= left){
list.add(matrix[down][tmp]);
tmp--;
}
down--;
if(down < up){
break;
}
//向上遍历
tmp = down;
while(tmp >= up){
list.add(matrix[tmp][left]);
tmp--;
}
left++;
if(left > right){
break;
}
}
return list;
}
}