剑指offer 面试题29 顺时针打印矩阵

#include<iostream>

using namespace std;

void printNumber(int number);
void PrintMatrixInCircle(int** numbers,int columns,int rows, int start);
void PrintMatrixClockwisely(int** numbers, int columns, int rows)
{
	if (numbers == nullptr || columns <= 0 || rows <= 0)
		return;
	int start = 0;
	while (columns > start * 2 && rows > start * 2)
	{
		PrintMatrixInCircle(numbers, columns, rows,start);
		++start;
	}
}

void PrintMatrixInCircle(int** numbers, int columns, int rows, int start)
{
	int EndX = columns - start - 1; //终止列号
	int EndY = rows - start - 1;    //终止行号

	//第一步 从左到右打印一行
	for (int i = start; i <= EndX; ++i)
	{
		int number = numbers[start][i];
		printNumber(number);
	}

	//第二步从上到下打印一列
	if (start < EndY) 
	{
		for (int i = start + 1; i <= EndY; ++i)
		{
			int number = numbers[i][EndX];
			printNumber(number);
		}
	}
	//第三步从右到左打印一行
	if (start < EndX && start < EndY)
	{
		for (int i = EndX - 1; i >= start; --i)
		{
			int number = numbers[EndY][i];
			printNumber(number);
		}
	}

	//第四步从下到上打印一列
	if (start < EndX && start < EndY - 1)
	{
		for (int i = EndY - 1; i >= start + 1; --i)
		{
			int number = numbers[i][start];
			printNumber(number);
		}
	}

}

void printNumber(int number)
{
	cout << number << " ";
}

int main()
{
	/*
	1    2    3    4    5
	6    7    8    9    10
	11   12   13   14   15
	16   17   18   19   20
	21   22   23   24   25
	*/
	int rows = 5;
	int columns = 5;
	int** numbers = new int*[rows];
	for (int i = 0; i < rows; ++i)
	{
		numbers[i] = new int[columns];
		for (int j = 0; j < columns; ++j)
		{
			numbers[i][j] = i * columns + j + 1;
		}
	}
	PrintMatrixClockwisely(numbers, columns, rows);
	cin.get();
	return 0;
}