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

力扣：剑指Offer 29.顺时针打印矩阵
题目:
输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。

思路：
与螺旋矩阵完全一样
代码：

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
       if (!matrix.size() || !matrix[0].size()) return {};
       vector<int>v;
       int left = 0, top = 0, right = matrix[0].size()-1, bottom = matrix.size()-1;
        while ( left <= right && top <= bottom){
            for(int i = left; i <= right; ++i){
                v.push_back(matrix[top][i]);
            }
            for(int i = top+1; i <= bottom; ++i){
                v.push_back(matrix[i][right]);
            }
            if (left < right && top < bottom){
                for(int i = right-1; i > left; --i){
                    v.push_back(matrix[bottom][i]);
                }
                for(int i = bottom; i > top; --i){
                    v.push_back(matrix[i][left]);
                }
            }
            left++;
            right--;
            top++;
            bottom--;
        }
        return v;
    }
};