题解 | #螺旋矩阵#

// 这能叫入门吗？！！！

// 写了个常规思路

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