LeetCode-29顺时针打印矩阵-简单

标题：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

代码Java

public int[] spiralOrder(int[][] matrix) {
    if (matrix.length == 0){
        int[] ans = new int[0];
        return ans;
    }
    int len = matrix[0].length * matrix.length;
    int[] ans = new int[len];
    int top = 0;
    int right = matrix[0].length - 1;
    int bottom = matrix.length - 1;
    int left = 0;
    int i = 0;
    while (left <= right && top <= bottom && i < len) {
        for (int j = left; j <= right; j++) {
            ans[i++] = matrix[top][j];
        }
        for (int j = top + 1; j <= bottom; j++) {
            ans[i++] = matrix[j][right];
        }
        if (left < right && top < bottom) {
            for (int j = right - 1; j > left; j--) {
                ans[i++] = matrix[bottom][j];
            }
            for (int j = bottom; j > top; j--) {
                ans[i++] = matrix[j][left];
            }
        }
        top++;
        right--;
        bottom--;
        left++;
    }
    return ans;
}