#include "iostream"
#include "iomanip"
using namespace std;
struct BinaryTreeNode{
int data;
BinaryTreeNode *left;
BinaryTreeNode *right;
};
void printMatrix(int number[][4],int rows,int columns)
{
if (number == NULL || columns <= 0 || rows <= 0)
return;
int rowMin = 0,rowMax=rows-1;
int colMin = 0, colMax = columns - 1;
while ((rowMin<=rowMax)&&(colMin<=colMax))
{
for (int j = colMin; j <=colMax;j++)
{
cout << setw(4) << number[rowMin][j];
}
rowMin++;
for (int i = rowMin; i <= rowMax; i++)
{
cout << setw(4) << number[i][colMax];
}
colMax--;
for (int j = colMax; j>=rowMin-1; j--)
{
cout << setw(4) << number[rowMax][j];
}
rowMax--;
for (int i = rowMax; i >= rowMin;i--)
{
cout << setw(4) << number[i][colMin];
}
colMin++;
}
}
int main()
{
int a[][4] = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }};
printMatrix(a,2, 4);
system("pause");
return 0;
}
剑指offer面试题20:顺时针打印矩阵(自己的算法,不是书上的)
最新推荐文章于 2022-03-23 19:48:38 发布