[剑指offer]顺时针打印矩阵
题目描述
输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字。
示例 1:
输入:matrix = [[1,2,3],[4,5,6],[7,8,9]]
输出:[1,2,3,6,9,8,7,4,5]
示例 2:
输入:matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
输出:[1,2,3,4,8,12,11,10,9,5,6,7]
限制:
0 <= matrix.length <= 100
0 <= matrix[i].length <= 100
解题思路
- 向右遍历 之后rowbegin+1
- 向下遍历 之后colend-1
- 向左遍历 之后rowend-1
- 向上遍历 之后colbegin+1
实现代码
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
vector<int> res;
if(matrix.size()==0)
return res;
int rowbegin = 0;
int rowend = matrix.size();
int colbegin = 0;
int colend = matrix[0].size();
while(rowbegin<rowend&colbegin<colend){
//向右
for(int i=colbegin;i<colend;i++)
res.push_back(matrix[rowbegin][i]);
rowbegin++;
//向下
for(int i=rowbegin;i<rowend;i++)
res.push_back(matrix[i][colend-1]);
colend--;
//向左
if(rowbegin<rowend){//试试[[1,2,3,4],[5,6,7,8],[9,10,11,12]]
for(int i=colend-1;i>=colbegin;i--)
res.push_back(matrix[rowend-1][i]);
rowend--;
}
//向上
if(colbegin<colend){//试试[[7],[9],[0]]
for(int i=rowend-1;i>=rowbegin;i--)
res.push_back(matrix[i][colbegin]);
colbegin++;
}
}
return res;
}
};