【LeetCode 54】 Spiral Matrix

题目描述

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

Example 1:

Input:
[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]
Output: [1,2,3,6,9,8,7,4,5]

Example 2:

Input:
[
  [1, 2, 3, 4],
  [5, 6, 7, 8],
  [9,10,11,12]
]
Output: [1,2,3,4,8,12,11,10,9,5,6,7]

思路

模拟过程，四个值表示临界。

代码

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if (matrix.empty()) return {};
        
        int top = 0, bottom = matrix.size()-1, left = 0, right = matrix[0].size()-1;
        
        vector<int> res;
        while(true) {
            cout << top << " " << bottom << " " << left << " " << right << "==\n";
            for (int i=left; i<=right; ++i) res.push_back(matrix[top][i]);
            if (++top > bottom) break;
            for (int i=top; i<=bottom; ++i) res.push_back(matrix[i][right]);
            if (--right < left) break;
            for (int i=right; i>=left; --i) res.push_back(matrix[bottom][i]);
            if (--bottom < top) break;
            for (int i=bottom; i>=top; --i) res.push_back(matrix[i][left]);
            if (++left > right) break;
        }
        return res;
    }
};