题目描述
给定一个包含 m x n 个元素的矩阵(m 行, n 列),请按照顺时针螺旋顺序,返回矩阵中的所有元素。
输入:
[
[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 {
public:
vector<int> spiralOrder(vector<vector<int>>& matrix) {
int rows = matrix.size();
int cols = 0;
if(rows != 0)
cols = matrix[0].size();
vector<int> clockwise;
if(rows == 0 || cols == 0)
return clockwise;
for(int start = 0; start*2 < rows && start*2 < cols; start++){ // 用&&
printMatrixClockwise(matrix, rows, cols, start, clockwise);
}
return clockwise;
}
void printMatrixClockwise(vector<vector<int> >& matrix, int rows, int cols, int start, vector<int> &clockwise){
int endX = cols - 1 - start;
int endY = rows - 1 - start;
for(int j = start; j <= endX; j++){
clockwise.push_back(matrix[start][j]);
}
if(endY-start > 0){
for(int i = start+1; i <= endY; i++){
clockwise.push_back(matrix[i][endX]);
}
}
if(endX-start > 0 && endY-start > 0){
for(int j = endX-1; j>=start; j--){
clockwise.push_back(matrix[endY][j]);
}
}
if(endX-start > 0 && endY-start > 1){
for(int i = endY-1; i > start; i--){ // 注意这里是 i > start
clockwise.push_back(matrix[i][start]);
}
}
}
};
剑指offer原题。