顺时针打印矩阵

难点：

边界条件判断有点复杂，可以画一个图形帮组我们思考。

代码如下：

	//参数：数组名，列数，行数，这圈开始的坐标值(横纵坐标一样)
void PrintMatrixInCircle(int** numbers, int columns, int rows, int start)
{
	int endX = columns-1-start;
	int endY = rows-1-start;
	int number;

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

	//从上到下打印一列
	if ( start < endY )
	{
		for ( int i = start+1; i <= endY; i++ )
		{
			number = numbers[i][endX];
			cout << number <<" ";
		}
	}

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

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

//参数依次为：二维数组名，列数，行数
void PrintMatrixClockwisely(int** numbers, int columns, int rows)
{
	//边界条件
	if ( numbers == NULL || columns <= 0 || rows <= 0 )
		return;

	int start = 0;
	
	//按照圈数，处理每圈调用一次PrintMatrixInCircle函数
	//思路：输出每圈数值时，左上角的数字的横纵坐标是一致的。作为我们处理的开始条件---分析出这一条是关键
	while ( columns > start*2 && rows > start*2 )
	{
		PrintMatrixInCircle(numbers,columns,rows,start);
		start++;
	}

	cout << endl;
}

用以下代码进行测试

int main()  
{  
	int TwoDArr[3][5]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
	int** p = new int*[3];
	for ( int i = 0; i < 3; i++ )
	{
		p[i] = TwoDArr[i];
	}

	PrintMatrixClockwisely(p,5,3);

	return 0;  
}