剑指 Offer 29. 顺时针打印矩阵

剑指 Offer 29. 顺时针打印矩阵

剑指 Offer 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

---

思路

该题与数据结构与算法—螺旋矩阵、整数反转题类似

只不过上面那个返回的数组是List
这个数组返回的是int[]
在数组操作的时候不太一样，其余都是一样

class Solution {
    public int[] spiralOrder(int[][] matrix) {
        //边界条件
        if (matrix == null || matrix.length == 0) return new int[0];
        if (matrix[0] == null || matrix[0].length == 0) return new int[0];

        int matrixRow = matrix.length;
        int matrixCol = matrix[0].length;

        int[] resultArray = new int[matrixRow * matrixCol];
        
        //index坐标
        int top = 0;
        int bottom = matrix.length - 1;
        int left = 0;
        int right = matrix[0].length - 1;
        
        int index = 0;
        while(top <= bottom && left <= right){

            for (int i = left; i <= right; i++){
                resultArray[index++] = matrix[top][i];
            }

            top++;

            if (top > bottom || left > right) break;

            for (int i = top; i <= bottom; i++){
                resultArray[index++] = matrix[i][right];
            }

            right--;

            if (top > bottom || left > right) break;

            for (int i = right; i >= left; i--){
                resultArray[index++] = matrix[bottom][i];
            }

            bottom--;

            if (top > bottom || left > right) break;

            for (int i = bottom; i >= top; i--){
                resultArray[index++] = matrix[i][left];
            }

            left++;

            if (top > bottom || left > right) break;
        }
        
        return resultArray;
    }
}

if (top > bottom || left > right) break;这行代码可以在每次for循环前面加上，保证不会数组越界