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

目录结构

1.题目

2.题解

---

1.题目

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

示例：

输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出：[1,2,3,6,9,8,7,4,5]


输入：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

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

2.题解

模拟。

public class Offer29 {

    @Test
    public void test() {
        int[][] matrix = {
                {1, 2, 3, 4},
                {5, 6, 7, 8},
                {9, 10, 11, 12}
        };
        System.out.println(Arrays.toString(spiralOrder(matrix)));
    }

    public int[] spiralOrder(int[][] matrix) {
        int len1 = matrix.length, len2 = matrix[0].length;
        int row1 = 0, row2 = len1 - 1, col1 = 0, col2 = len2 - 1, count = 0, num = len1 * len2;
        int[] result = new int[num];
        while (count < num) {
            for (int i = col1; i <= col2; i++) {
                if (count == num) break;
                result[count++] = matrix[row1][i];
            }
            row1++;
            for (int i = row1; i <= row2; i++) {
                if (count == num) break;
                result[count++] = matrix[i][col2];
            }
            col2--;
            for (int i = col2; i >= col1; i--) {
                if (count == num) break;
                result[count++] = matrix[row2][i];
            }
            row2--;
            for (int i = row2; i >= row1; i--) {
                if (count == num) break;
                result[count++] = matrix[i][col1];
            }
            col1++;
        }
        return result;
    }
}

• 时间复杂度：
• 空间复杂度：