顺时针打印矩阵

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

    public int[] spiralOrder(int[][] matrix) {
        if (matrix.length == 0) return new int[0];
        int l = 0;
        int r = matrix[0].length - 1;
        int t = 0;
        int b = matrix.length - 1;
        int x = 0;

        int[] ans = new int[(r + 1) * (b + 1)];
        while (true) {
            for (int i = l; i <= r; i++) ans[x++] = matrix[t][i];//left-right
            if (++t > b) break;
            for (int i = t; i <= b; i++) ans[x++] = matrix[i][r];//top-bottom
            if (l > --r) break;
            for (int i = r; i >= l; i--) ans[x++] = matrix[b][i];//right-left
            if (t > --b) break;
            for (int i = b; i >= t; i--) ans[x++] = matrix[i][l];//bottom-top
            if (++l > r) break;
        }
        return ans;
    }