LCR.146螺旋遍历二维数组

与螺旋遍历方阵不同，所以不能使用方针的模拟方法

class Solution {
public:
    vector<int> spiralArray(vector<vector<int>>& array) {
        vector<int> res;
        if(array.empty()) return res;
        int n = array.size();
        int m = array[0].size();
        vector<vector<bool>> st(n,vector<bool>(m,false));
        int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
        int x = 0,y = 0,d = 1;
        for(int i = 0;i < n * m;i ++)
        {
            res.push_back(array[x][y]);
            st[x][y] = true;
            int a = x + dx[d],b = y + dy[d];
            if(a >= n || a < 0 || b >= m || b < 0 || st[a][b])
            {
                d = (d+1) % 4;
                a = x + dx[d],b = y + dy[d];
            }
            x = a,y = b;
        }
        return res;

    }
};