面试题29：顺时针打印矩阵

#include<iostream>
#define Row 4
#define Col 4

void PrintArray(int (*number)[Col], int rows, int cols, int start)
{
	int endY = rows - 1 - start;
	int endX = cols - 1 - start;
	for (int i = start;i <= endX;++i)//打印第一行
		std::cout << number[start][i] << " ";
	if (start < endY)//从上往下打印，至少需要有两行
	{
		for (int i = start + 1;i <= endY;++i)
			std::cout << number[i][endX] << " ";
	}
	if (start < endY && start < endX)//从右往左打，至少需要有两行两列
	{
		for (int i = endX - 1;i >= start;--i)
			std::cout << number[endY][i] << " ";
	}
	if (start < endX && start < endY - 1)//从下往上打，至少需要有三行两列
	{
		for (int i = endY - 1;i > start;--i)
			std::cout << number[i][start] << " ";
	}
}
void PrintArray(int (*number)[Col], int rows, int cols)
{
	if (number == nullptr || rows <= 0 || cols <= 0)return;
	int start = 0;
	while (rows > start * 2 && cols > start * 2)//终止条件就为最后一圈的左上交坐标*2不大于行列值
	{
		PrintArray(number, rows, cols, start);
		++start;
	}
}

int main(int argc, char* argv[])
{
	int number[Row][Col] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 };
	PrintArray(number, Row, Col);
	std::cin.get();
	return 0;
}