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.

提示：编写代码时，可以先不考虑单行或者单列的情况，等编写完成后，再假设此时是单行（列），然后走一遍程序，根据哪里会出问题来修改解决单行（列）情况。

import java.util.ArrayList;

public class Test19 {
    public ArrayList<Integer> printMatrix(int[][] matrix) {
        int tR = 0;
        int tC = 0;
        int dR = matrix.length - 1;
        int dC = matrix[0].length - 1;
        ArrayList<Integer> list = new ArrayList<>();
        while (tR <= dR && tC <= dC) {
            list = printEdge(matrix, tR++, tC++, dR--, dC--, list);
        }
        return list;
    }

    public ArrayList<Integer> printEdge(int[][] matrix, int tR, int tC, int dR, int dC, ArrayList<Integer> list) {
        if (tR == dR) {
            for (int i = tC; i <= dC; i++) {
                list.add(matrix[tR][i]);
            }
        } else if (tC == dC) {
            for (int i = tR; i <= dR; i++) {
                list.add(matrix[i][tC]);
            }
        } else {
            int curR = tR;
            int curC = tC;
            while (curC != dC) {
                list.add(matrix[curR][curC]);
                curC++;
            }
            while (curR != dR) {
                list.add(matrix[curR][curC]);
                curR++;
            }
            while (curC != tC) {
                list.add(matrix[curR][curC]);
                curC--;
            }
            while (curR != tR) {
                list.add(matrix[curR][curC]);
                curR--;
            }
        }
        return list;
    }

    public static void main(String[] args) {
        int[][] matrix = {{1, 2, 3, 4,5}, { 6, 7, 8,9,10}, {11, 12,13,14,15},
                { 16,17,18,19,20},{ 21,22,23,24,25}};
        Test19 t = new Test19();
        ArrayList<Integer> res = t.printMatrix(matrix);
        System.out.println(res);
    }

//    非递归
    public ArrayList<Integer> printMatrix2(int[][] matrix) {
        if (matrix == null)
            return null;
        ArrayList<Integer> list = new ArrayList<>();

        int row = matrix.length;
        int col = matrix[0].length;
        int left = 0, right = col - 1, top = 0, bottom = row - 1;

        while (left <= right && top <= bottom) {
            //从左到右
            for (int i = left; i <= right; i++) {
                list.add(matrix[top][i]);
            }

            //从上到下
            for (int i = top + 1; i <= bottom; i++) {
                list.add(matrix[i][right]);
            }

            //从右到左
            //防止单行情况
            if (top != bottom) {
                for (int i = right - 1; i >= left; i--) {
                    list.add(matrix[bottom][i]);
                }
            }

            //从下到上
            //防止单列情况
            if (left != right) {
                for (int i = bottom - 1; i > top; i--) {
                    list.add(matrix[i][left]);
                }
            }

            left++; right--; top++; bottom--;
        }
        return list;
    }
}