20. 顺时针打印矩阵

题目：

输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。例如：如果输入如下矩阵：
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
则依次打印出数字 1 2 3 4 8 12 16 15 14 13 9 5 6 7 11 10

代码实现：

void PrintMatrixInCircle(int** numbers, int columns, int rows, int start)
{
	int endX = columns - 1 - start;
	int endY = rows - 1 - start;

	// 从左到右打印一行
	for (int idx = start; idx <= endX; ++idx)
	{
		int curNum = numbers[start][idx];
		std::cout << curNum << " ";
	}

	// 从上到下打印一行
	if (start < endY)
	{
		for (int idx = start; idx <= endY; ++idx)
		{
			int curNum = numbers[idx][endY];
			std::cout << curNum << " ";
		}
	}

	// 从右到左打印一行
	if (start < endX && start < endY)
	{
		for (int idx = endX - 1; idx >= start; --idx)
		{
			int curNum = numbers[endY][idx];
			std::cout << curNum << " ";
		}
	}

	// 从下到上打印一行
	if (start < endX && start < endY - 1)
	{
		for (int idx = endY - 1; idx >= start + 1; --idx)
		{
			int curNum = numbers[idx][start];
			std::cout << curNum << " ";
		}
	}
	
}

void PrintMatrixClockWisely(int** numbers, int columns, int rows)
{
	if (nullptr == numbers || columns <= 0 || rows <= 0) return;

	int start = 0;

	while (columns > start * 2 && rows > start * 2)
	{
		PrintMatrixInCircle(numbers, columns, rows, start);
		++start;
	}
}