顺时针打印矩阵

顺时针打印矩阵

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

示例 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]

public int[] spiralOrder(int[][] matrix) {
    if (matrix == null || matrix.length == 0) {
        return new int[0];
    }
    int row = matrix.length;
    int col = matrix[0].length;
    int top = 0, bottom = row - 1, left = 0, right = col - 1;
    int[] ans = new int[row * col];
    int index = 0;
    while (true) {
        for (int i = left; i <= right; i++) {
            ans[index++] = matrix[top][i];
        }
        if(index == ans.length) {
            break;
        }
        top++;
        for (int i = top; i <= bottom; i++) {
            ans[index++] = matrix[i][right];
        }
        if(index == ans.length) {
            break;
        }
        right--;
        for (int i = right; i >= left; i--) {
            ans[index++] = matrix[bottom][i];
        }
        if(index == ans.length) {
            break;
        }
        bottom--;
        for (int i = bottom; i >= top; i--) {
            ans[index++] = matrix[i][left];
        }
        if(index == ans.length) {
            break;
        }
        left++;
    }
    return ans;
}