剑指Offer(牛客网 Java)19——顺时针打印矩阵

题目描述

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字，例如，如果输入如下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  2  3  4 
 5  6  7  8
 9 10 11 12
13 14 15 16

输出：
 1  2  3  4
12 13 14  5
11 16 15  6
10  9  8  7

根据题意，就是先向右遍历，遍历到右边界后，矩阵上边界减少1；
向下遍历，遍历到下边界后，矩阵右边界减少1；
向左遍历，遍历到左边界后，矩阵下边界减少1；
向上遍历，遍历到上边界后，矩阵左边界减少1。
重复上面的4个步骤，直到某个边界减少后，超过了对向边界(比如左边界≥右边界时)，说明矩阵遍历结束。

代码实现

import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printMatrix(int [][] matrix) {
        ArrayList<Integer> resultList = new ArrayList<>();

        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return resultList;
        }

        int upBound = 0;
        int downBound = matrix.length - 1;
        int leftBound = 0;
        int rightBound = matrix[0].length - 1;
        while (true) {
            for (int rightColLoop = leftBound; rightColLoop <= rightBound; rightColLoop++) {
                resultList.add(matrix[upBound][rightColLoop]);
            }
            upBound++;
            
            if (upBound > downBound) {
                break;
            }

            for (int downRowLoop = upBound; downRowLoop <= downBound; downRowLoop++) {
                resultList.add(matrix[downRowLoop][rightBound]);
            }
            rightBound--;
            
            if (rightBound < leftBound) {
                break;
            }

            for (int leftColLoop = rightBound; leftColLoop >= leftBound; leftColLoop--) {
                resultList.add(matrix[downBound][leftColLoop]);
            }
            downBound--;
            
            if (downBound < upBound) {
                break;
            }

            for (int upRowLoop = downBound; upRowLoop >= upBound; upRowLoop--) {
                resultList.add(matrix[upRowLoop][leftBound]);
            }
            leftBound++;
            
            if (leftBound > rightBound) {
                break;
            }

        }

        return resultList;
    }
}