顺时针打印矩阵（Java实现）

public class E29PrintMatriClockwisely {
    //顺时针打印矩阵

    public static void printMatriClockwisely(int[][] numbers, int rows, int cols){
        //将整个矩阵一圈一圈打印，起点的横纵坐标值相等
        if (numbers == null || rows <= 0 || cols <= 0)
            return;

        int start = 0;
        while(rows > 2 * start && cols > 2 * start){
            printMatriInOrder(numbers, rows, cols, start);
            start ++;
        }
    }

    private static void printMatriInOrder(int[][] numbers, int rows,
                                          int cols, int start){
        //打印一圈
        int endX = cols - start - 1;
        int endY = rows - start - 1;
        //向右,至少一列
        if (start <= endX){
            for (int i = start; i <= endX; i ++){
                System.out.print(numbers[start][i] + "\t");
            }
        }
        //向下，至少两行
        if (start < endY){
            for (int i = start + 1; i <= endY; i ++)
                System.out.print(numbers[i][endX] + "\t");
        }
        //向左，至少两行两列
        if (start < endX && start < endY){
            for (int i = endX - 1; i >= start; i --)
                System.out.print(numbers[endY][i] + "\t");
        }
        //向上，至少三行两列
        if (start < endX && start < endY - 1){
            for (int i = endY - 1; i > start; i --)
                System.out.print(numbers[i][start] + "\t");
        }
    }

    //测试用例
    public static void main(String[] args){
        int[][] numbers = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
        E29PrintMatriClockwisely.printMatriClockwisely(numbers, 3, 3);
    }
}