剑指 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
注意：本题与主站 54 题相同：https://leetcode-cn.com/problems/spiral-matrix/

class Solution {
    public int[] spiralOrder(int[][] matrix) {
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return new int[0];
        }
        int m = matrix.length, n = matrix[0].length, i = 0, j = 0, k = 0;
        int[] res = new int[m * n];
        while(i < m && j < n) {
            for(int t = j; t < n; ++t) {
                // System.out.println(k);
                res[k++] = matrix[i][t];
            }
            i++;
            for(int t = i; t < m; ++t) {
                res[k++] = matrix[t][n - 1];
            }
            n--;
            if(i >= m) {break;}
            for(int t = n - 1; t >= j; --t) {
                res[k++] = matrix[m - 1][t];
            }
            m--;
            if(j >= n) {break;}
            for(int t = m - 1; t >= i; --t) {
                res[k++] = matrix[t][j];
            }
            j++;
        }
        return res;
    }
}