[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]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/spiral-matrix
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

方法：设置四个指针边界，螺旋遍历matrix即可，注意循环条件为left <= right && top <= low；

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int top = 0;
        int low = matrix.size() - 1;
        vector<int> res;
        if (low == -1)
            return res;
        int left = 0;
        int right = matrix[0].size() - 1;
        
        while (left <= right && top <= low) {
            for (int i = left; i <= right; i++) {
                res.push_back(matrix[top][i]);
            }
            for (int i = top + 1; i <= low; i++) {
                res.push_back(matrix[i][right]);
            }
            if (top < low)
                for (int i = right - 1; i >= left; i--)
                    res.push_back(matrix[low][i]);
            if (left < right)
                for (int i = low - 1; i > top; i--)
                    res.push_back(matrix[i][left]);
            left++;
            right--;
            top++;
            low--;
        }
        return res;
    }
};