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

解答：暴力循环

class Solution {
    public int[] spiralOrder(int[][] matrix) {
        if (matrix.length == 0) {
            return new int[]{};
        }
        int rows = matrix.length;
        int cols = matrix[0].length;
        int[] result = new int[rows*cols];
        int circleCount = rows > cols ? cols/2+cols%2 : rows/2+rows%2;
        int startIndex = 0;
        int count = 0;
        while (circleCount > 0) {
             上
            for (int i = startIndex; i < cols-startIndex; i++) {
                result[count++] = matrix[startIndex][i];
            }
            if (count >= result.length) {
                break;
            }
             右
            for (int j = startIndex+1; j < rows-startIndex; j++) {
                result[count++] = matrix[j][cols-1-startIndex];
            }
            if (count >= result.length) {
                break;
            }
             下
            for (int i = cols-2-startIndex; i >= startIndex; i--) {
                result[count++] = matrix[rows-1-startIndex][i];
            }
            if (count >= result.length) {
                break;
            }
             左
            for (int j = rows-2-startIndex; j >=startIndex+1; j--) {
                result[count++] = matrix[j][startIndex];
            }
            if (count >= result.length) {
                break;
            }
            circleCount--;
            startIndex++;
        }
        return result;
    }
}