剑指 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:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if (matrix.size() == 0 || matrix[0].size() == 0) {
            return {};
        }
        int rows = matrix.size(), columns = matrix[0].size();
        vector<int> order;
        int left = 0, right = columns - 1, top = 0, bottom = rows - 1;
        while (left <= right && top <= bottom) {
            for (int column = left; column <= right; column++) {
                order.push_back(matrix[top][column]);
            }
            top++;
            if(top > bottom) break;
            for (int row = top; row <= bottom; row++) {
                order.push_back(matrix[row][right]);
            }
            right--;
            if(right < left) break;
            for (int column = right; column >= left; column--) {
                order.push_back(matrix[bottom][column]);
            }
            bottom--;
            if(bottom < top) break;
            for (int row = bottom; row >= top; row--) {
                order.push_back(matrix[row][left]);
            }
            left++;
            if(left > right) break;
        }
        return order;
    }
};