29. 顺时针打印矩阵

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。

示例 1：
输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出：[1,2,3,6,9,8,7,4,5]

示例 2：
输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出：[1,2,3,4,8,12,11,10,9,5,6,7]

限制：
0 <= matrix.length <= 100
0 <= matrix[i].length <= 100

代码实现1（自通过方法）：模拟

感觉要把自己笨死了 - -

class Solution {
    public int[] spiralOrder(int[][] matrix) {
        int line = matrix.length;
        if(line==0) return new int[0];
        int column = matrix[0].length;
        int[] res = new int[line * column];
        int left = 0, right = column - 1, top = 0, bottom = line - 1;
        int index = 0;
        int size = line * column - 1;

        while (left <= right && top <= bottom) {
            //从左到右
            for (int i = left; i <= right && index <= size; ++i) {
                res[index++] = matrix[top][i];
            }
            top++;
            // 从上到下
            for (int j = top; j <= bottom&& index <= size; ++j) {
                res[index++] = matrix[j][right];
            }
            right--;
            // 从右到左
            for (int i = right; i >= left&& index <= size; --i) {
                res[index++] = matrix[bottom][i];
            }
            bottom--;
            // 从下到上
            for (int j = bottom; j >= top&& index <= size; --j) {
                res[index++] = matrix[j][left];
            }
            left++;
        }
        return res;
    }
}

 

代码实现2: (简化方法1) 模拟

class Solution {
    public static int[] spiralOrder(int[][] matrix) {
        if (matrix.length == 0) return new int[0];
        int left = 0, right = matrix[0].length - 1, top = 0, bottom = matrix.length - 1, x = 0;
        int[] res = new int[(right + 1) * (bottom + 1)];
        while (true) {
            // left to right.
            for (int i = left; i <= right; i++) res[x++] = matrix[top][i];
            if (++top > bottom) break;
            // top to bottom.
            for (int i = top; i <= bottom; i++) res[x++] = matrix[i][right];
            if (left > --right) break;
            // right to left.
            for (int i = right; i >= left; i--) res[x++] = matrix[bottom][i];
            if (top > --bottom) break;
            // bottom to top.
            for (int i = bottom; i >= top; i--) res[x++] = matrix[i][left];
            if (++left > right) break;
        }
        return res;
    }
}