Leecode 54. 螺旋矩阵

原题链接：Leecode 54. 螺旋矩阵

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector<int> v;
        int tall=0,low=matrix.size()-1,left=0,right=matrix[0].size()-1;
        int sum=(low+1)*(right+1);
        int i=0,j=0,turn=0;
        while(sum--)
        {
            v.push_back(matrix[i][j]);
            if(turn==0)
            {
                if(j==right)
                {
                    turn=1; i++; continue;
                }
                j++;
            }
            else if(turn==1)
            {
                if(i==low)
                {
                    turn=2; j--; continue;
                }
                i++;
            }
            else if(turn==2)
            {
                if(j==left)
                {
                    turn=3; i--; continue;
                }
                j--;
            }
            else if(turn==3)
            {
                if(i==(tall+1))
                {
                    turn=0; j++;
                    tall++; low--; left++; right--;
                    continue;
                }
                i--;
            }
        }
        return v;
    }
};