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 {
    vector<vector<int>> delta = {
  {0,1}, {1,0}, {0,-1}, {-1, 0}};
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if (matrix.size() == 0 || matrix[0].size() == 0) {
            return {};
        }
        int row = matrix.size(), col = matrix[0].size();
        int total = row * col;
        vector<int> res = vector<int>(total);
        vector<vector<int>> status = vector<vector<int>>(row, vector<int>(col, 0));
        int m =