LetCode 54. 螺旋矩阵

static int x=[](){
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();
class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector<int> res;
        if (matrix.size() == 0)
            return res;
        int m = matrix.size();
        int n = matrix[0].size();
        if (m == 1)
            return matrix[0];
        // 这里分别用4个变量记录矩阵的4个顶点
        int Left = 0, Right = n - 1, Top = 0, Bottom = m - 1;
        while(res.size() < m * n){
            if (res.size() < m * n)
                for (int i = Left; i <= Right; i++)
                    res.push_back(matrix[Top][i]);
            if (res.size() < m * n)
                for (int i = Top + 1; i <= Bottom; i++)
                    res.push_back(matrix[i][Right]);
            if (res.size() < m * n)
                for (int i = Right - 1; i >= Left; i--)
                    res.push_back(matrix[Bottom][i]);
            if (res.size() < m * n)
                for (int i = Bottom - 1; i > Top; i--)
                    res.push_back(matrix[i][Left]);
            Left++;
            Right--;
            Top++;
            Bottom--;
        }
        return res;
    }
};