LeetCode - 字节跳动模拟面试 - 螺旋矩阵

给定一个包含 m x n 个元素的矩阵（m 行, n 列），请按照顺时针螺旋顺序，返回矩阵中的所有元素。

示例 1:

输入:
[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]
输出: [1,2,3,6,9,8,7,4,5]

示例 2:

输入:
[
  [1, 2, 3, 4],
  [5, 6, 7, 8],
  [9,10,11,12]
]
输出: [1,2,3,4,8,12,11,10,9,5,6,7]

class Solution {
public:
    vector<int> r ;
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int m = matrix.size();
        if(m==0){
            return r;
        }
        int n = matrix[0].size();
        int is = 0;
        int ie = m;
        int js = 0;
        int je = n;
        int d = 0;
        spiralOrder(matrix,is,ie,js,je,d);
        return r;
    }
    void spiralOrder(vector<vector<int>>& matrix,int is,int ie,int js,int je,int d) {
        std::cout<<is<<" "<<ie<<" "<<js<<" "<<je<<" "<<std::endl;
        if(d==0 && js<je){
            for(int j=js;j<je;j++){
                r.push_back(matrix[is][j]);
            }
            spiralOrder(matrix,is+1,ie,js,je,(d+1)%4);
        }else if(d==1 && is<ie){
            for(int i=is;i<ie;i++){
                r.push_back(matrix[i][je-1]);
            }
            spiralOrder(matrix,is,ie,js,je-1,(d+1)%4);
        }else if(d==2 && js<je){
            for(int j=je-1;j>=js;j--){
                r.push_back(matrix[ie-1][j]);
            }
            spiralOrder(matrix,is,ie-1,js,je,(d+1)%4);
        }else if(d==3 && is<ie){
            for(int i=ie-1;i>=is;i--){
                r.push_back(matrix[i][js]);
            }
            spiralOrder(matrix,is,ie,js+1,je,(d+1)%4);
        }else{
            return;
        }
    }
};

AC100%