算法：顺时针打印矩阵

 

//顺时针打印矩阵
void PrintMatraixClockwisely(int** numbers, int columns, int rows)
{
	if(numbers == NULL || columns <= 0 || rows <= 0)
		return;
	int start = 0;
	while(columns > start * 2 && rows > start * 2)
	{
		PrintMatrixIndexCircle(numbers, columns, rows, start);
		++start;
	}
}

void PrintMatrixIndexCircle(int **numbers, int columns, int rows, int start)
{
	int endX = columns - 1 - start;
	int endY = rows - 1 - start;
	// 从左到右打印一行
	for(int i = start; i <= endX; ++i)
	{
		cout << number[start][i];
	}
	//从上到下打印一列
	if(start < endY)
	{
		for(int i = start + 1; i <= endY; ++i)
		{
			cout << numbers[i][endX];
		}
	}
	//从右到左打印一行
	if(start < endX && start < endY)
	{
		for(int i = endX - 1; i >= start; --i)
		{
			cout << numbers[endY][i];
		}
	}
	// 从下到上打印一行
	if(start < endX && start < endY - 1)
	{
		for(int i = endY - 1; i >= start + 1; --i)
		{
			cout << numbers[i][start];
		}
	}
}