leetcode 54.螺旋矩阵

题目

给定一个包含 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> result;
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int m = matrix.size();
        if(m == 0)
            return result;
        int n = matrix[0].size();
        RecurOrder(matrix,0,0,m - 1,n - 1);
        return result;
    }

    void RecurOrder(vector<vector<int>> &matrix,int start_i,int start_j,int end_i,int end_j)
    {
        if(start_i > end_i || start_j > end_j)
            return;
        else {
          //  cout<<start_i<<start_j<<end_i<<end_j<<endl;
            for(int i = start_j; i <= end_j;i++)
                result.push_back(matrix[start_i][i]);
            
            for(int i = start_i + 1; i < end_i;i++)
                result.push_back(matrix[i][end_j]);
            
            if(start_i < end_i)
            {
                for(int i = end_j;i >= start_j;i--)
                    result.push_back(matrix[end_i][i]);
            }
           // cout<<"?";
            if(start_j < end_j)
            {
                for(int i = end_i - 1;i > start_i;i--)
                    result.push_back(matrix[i][start_i]);
            }
          //  cout<<"?";
            RecurOrder(matrix,start_i + 1,start_j + 1,end_i - 1,end_j - 1); 
            // 处理完外围之和转化成处理内圈的子问题
        }
    }
};