简单顺时针打印矩阵,巧妙的使用上下左右的来记录即可!
https://leetcode-cn.com/problems/shun-shi-zhen-da-yin-ju-zhen-lcof/
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> res;
if(matrix.empty()) return res;
int top = 0, down = matrix.size() - 1;
int left = 0, right = matrix[0].size() - 1;
while(true) {
for(int i = left; i <= right ; i++) {
res.push_back(matrix[top][i]);
}
if(++top > down) break;
for(int i = top; i <= down; i++) {
res.push_back(matrix[i][right]);
}
if(--right < left) break;
for(int i = right; i >= left; i--) {
res.push_back(matrix[down][i]);
}
if(--down < top) break;
for(int i = down; i >= top; i--) {
res.push_back(matrix[i][left]);
}
if(++left > right) break;
}
return res;
}
};