【LeetCode】54. Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

Example 1:

Input:
[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]
Output: [1,2,3,6,9,8,7,4,5]

Example 2:

Input:
[
  [1, 2, 3, 4],
  [5, 6, 7, 8],
  [9,10,11,12]
]
Output: [1,2,3,4,8,12,11,10,9,5,6,7]

给一个矩阵，螺旋形输出所有元素。我把前进方向分成四种情况，向右，向下，向左，向上，然后按前进方向输出。注意一下起始位置和边界情况，细心一点就好了，不难就是有些绕。

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector<int> res;
        if(matrix.empty())
            return res;
        int count = matrix.size()*matrix[0].size();
        int row = matrix.size(),col = matrix[0].size();
        int r_r=row,c_r = col,r_d=row,c_d=col,r_l=row,c_l=col,r_u=row,c_u=col;
        int i=0,j=0,direct;
        bool right=true,left=false,down=false,up=false;
       
        while(count>0){
            for(direct = 1;direct<=4&&count>0;direct++){
                if(direct==1){//向右
                    i = row-r_r;
                    for(j=col-c_r;j<c_r;j++){
                        res.push_back(matrix[i][j]);
                        count--;
                    }
                    c_r--;
                    r_r--;
                }
                if(direct==2){//向下
                    j = c_d-1;
                    for(i = row-r_d+1;i<r_d&&count>0;i++){
                        res.push_back(matrix[i][j]);
                        count--;
                    }
                    r_d--;
                    c_d--;
                }
                if(direct==3){//向左
                    i = r_l-1;
                    for(j=c_l-2;j>=col-c_l&&count>0;j--){
                        res.push_back(matrix[i][j]);
                        count--;
                    }
                    r_l--;
                    c_l--;
                }
                if(direct==4){//向上
                    j=col-c_u;
                    for(i=r_u-2;i>row-r_u&&count>0;i--){
                        res.push_back(matrix[i][j]);
                        count--;
                    }
                    r_u--;
                    c_u--;
                }
            }
        }
        return res;
        
    }
};