题目:
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
For example,
Given the following matrix:
[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ]
You should return [1,2,3,6,9,8,7,4,5]
.
题目来源:https://oj.leetcode.com/problems/spiral-matrix/
解题思路:从左至右,然后从上至下,然后从右至左,最后从下到上。按这个顺序不断的把矩阵剥离,直到不剩下任何元素为止。如果行和列的坐标比矩阵的一半还大说明已经剥离完了,如果最后只剩下一行或一列,剥离完以后直接返回。
spiralOrder是迭代版,spiralOrder1是递归版:
#include<iostream>
#include<vector>
using namespace std;
void spiralPart(vector<vector<int> >&matrix,vector<int> &result,int row,int col)
{
if(row>((matrix.size()-1)>>1))//只需要循环一半就行
return ;
if(col>((matrix.front().size()-1)>>1))
return ;
for(int i=col;i<matrix.front().size()-col;i++)
result.push_back(matrix[row][i]);
for(int i=row+1;i<matrix.size()-row;i++)
result.push_back(matrix[i][matrix.front().size()-col-1]);
if(matrix.size()==row*2+1)//即当前的行是一个独行
return;
for(int i=matrix.front().size()-col-2;i>=col;i--)
result.push_back(matrix[matrix.size()-row-1][i]);
if(matrix.front().size()==col*2+1)//即当前的列是一个独列
return;
for(int i=matrix.size()-row-2;i>row;i--)
result.push_back(matrix[i][col]);
return spiralPart(matrix,result,row+1,col+1);
}
vector<int> spiralOrder(vector<vector<int> > &matrix)
{
vector<int> result;
if(matrix.empty())
return result;
spiralPart(matrix,result,0,0);
return result;
}
vector<int> spiralOrder1(vector<vector<int> > &matrix)
{
vector<int> result;
if(matrix.empty())
return result;
int row=0,col=0;
while(1)
{
if(row>((matrix.size()-1)>>1))//只需要循环一半就行
break;
if(col>((matrix.front().size()-1)>>1))
break;
for(int i=col;i<matrix.front().size()-col;i++)
result.push_back(matrix[row][i]);
for(int i=row+1;i<matrix.size()-row;i++)
result.push_back(matrix[i][matrix.front().size()-col-1]);
if(matrix.size()==row*2+1)//即当前的行是一个独行
break;
for(int i=matrix.front().size()-col-2;i>=col;i--)
result.push_back(matrix[matrix.size()-row-1][i]);
if(matrix.front().size()==col*2+1)//即当前的列是一个独列
break;
for(int i=matrix.size()-row-2;i>row;i--)
result.push_back(matrix[i][col]);
row++;
col++;
}
return result;
}
int main()
{
int A[]={2,5,8,4,0,-1};
vector<vector<int> >matrix;
matrix.push_back(vector<int>(A,A+3));
matrix.push_back(vector<int>(A+3,A+6));
vector<int> result=spiralOrder1(matrix);
system("pause");
return 0;
}