LEETCODE54. 螺旋矩阵

给你一个 m 行 n 列的矩阵 matrix ，请按照 顺时针螺旋顺序 ，返回矩阵中的所有元素。

输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出：[1,2,3,6,9,8,7,4,5]

解题：我自己方法，如果是奇数的行列，在判断嘛

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector<int> result;
        if (matrix.size() == 0) return result;
        int row = matrix.size() - 1;
        int colum = matrix[0].size() - 1;
        int left = 0;
        int right = colum ;
        int buttom = 0;
        int top = row;
        while (left < right && buttom < top) {
            for (int i = left; i < right; i++) {
                 result.push_back(matrix[buttom][i]);
            }
            for (int i = buttom; i < top; i++) {
                 result.push_back(matrix[i][right]);
            }
            for (int i = right; i >left; i--) {
                 result.push_back(matrix[top][i]);
            }
            for (int i = top; i >= buttom +1; i--) {
                 result.push_back(matrix[i][left]);
            }
            //break;
            left++;
            right--;
            buttom++;
            top--;
        }
        if (left == right ) {
            for (int i = buttom; i <= top; i++) {
                 result.push_back(matrix[i][left]);
            }
        }
        else if (buttom == top ) {
            for (int i = left; i <= right; i++) {
                 result.push_back(matrix[buttom][i]);
            }
        }
        return result;

    }
};