剑指Offer(牛客网)-顺时针打印矩阵

题目链接：

https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目来源：

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

代码如下：

import java.util.ArrayList;
public class Solution {
    public ArrayList<Integer> printMatrix(int[][] matrix) {
        if (matrix==null||matrix[0].length == 0 || matrix.length == 0) {
            return null;
        }
        ArrayList<Integer> list = new ArrayList<Integer>();
        int left = 0;
        int right = matrix[0].length - 1;
        int top = 0;
        int bottom = matrix.length - 1;
        while (left <= right && top <= bottom) {
            for (int i = left; i <= right; i++) {
                list.add(matrix[top][i]);
            }
            for (int j = top + 1; j <= bottom; j++) {
                list.add(matrix[j][right]);
            }
            if (top != bottom) {
                for (int k = right - 1; k >= left; k--) {
                    list.add(matrix[bottom][k]);
                }
            }
            if (left != right) {
                for (int l = bottom - 1; l > top; l--) {
                    list.add(matrix[l][left]);
                }
            }
            top++;
            left++;
            bottom--;
            right--;
        }
        return list;
    }
}