顺时针打印矩阵——JZ19

https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tags=&title=&difficulty=0&judgeStatus=0&rp=1

 

描述

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下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]

public class Jz19_printMatrix {

    @Test
    public void test() {
        //[[1,2],[3,4]]
        int[][] arr = {{1, 2}, {3, 4}};
        ArrayList<Integer> integers = printMatrix(arr);
        integers.forEach(a -> System.out.print(a + ","));
    }

    public ArrayList<Integer> printMatrix(int[][] matrix) {
        ArrayList<Integer> ans = new ArrayList<>();
        if (matrix.length == 0) {
            return ans;
        }
        int top = 0;
        int bottom = matrix.length - 1;
        int left = 0;
        int right = matrix[0].length - 1;
        int numCount = (bottom + 1) * (right + 1);
        while (true) {
            for (int i = left; i <= right; i++) {
                ans.add(matrix[top][i]);
            }
            top++;
            if (numCount == ans.size()) {
                break;
            }
            for (int i = top; i <= bottom; i++) {
                ans.add(matrix[i][right]);
            }
            right--;
            if (numCount == ans.size()) {
                break;
            }
            for (int i = right; i >= left; i--) {
                ans.add(matrix[bottom][i]);
            }
            bottom--;
            if (numCount == ans.size()) {
                break;
            }
            for (int i = bottom; i >= top; i--) {
                ans.add(matrix[i][left]);
            }
            left++;
            if (numCount == ans.size()) {
                break;
            }
        }
        return ans;
    }
}