一种打印螺旋式矩阵的方法

用户输入一个维度，打印从中心向外逆时针旋转的矩阵，左上角为最后一个数。例如输入5，输出为：

24 23 22 21 20

09 08 07 06 19

10 01 00 05 18

11 02 03 04 17

12 13 14 15 16

#include "stdafx.h"
#include "stdlib.h"
int _tmain(int argc, _TCHAR* argv[])
{
int n = 0;
long n_max = 0;
int x_h,x_l,y_h,y_l;
int i = 0;
int j = 0;

printf("请输入数字：");
scanf("%d",&n);

int **CircleArray;
CircleArray = new int *
;
for (int t = 0; t < n; t++)
{
CircleArray[t] = new int
;
}

n_max = n*n - 1;
x_h = n-1;
y_h = n-1;
x_l = 0;
y_l = 0;

while(n_max)
{
i = x_l;
for (j = y_l; j <= y_h; j++)//上边
{
if (0 == n_max)
{
CircleArray[i][j] = 0;
break;
}
else
{
CircleArray[i][j] = n_max--;
}
}
x_l += 1;

j = y_h;
for (i = x_l; i <= x_h; i++)//右边
{
if (0 == n_max)
{
CircleArray[i][j] = 0;
break;
}
else
{
CircleArray[i][j] = n_max--;
}
}
y_h -= 1;

i = x_h;
for (j = y_h; j >= y_l; j--)//下边
{
if (0 == n_max)
{
CircleArray[i][j] = 0;
break;
}
else
{
CircleArray[i][j] = n_max--;
}
}
x_h -= 1;

j = y_l;
for (i = x_h; i >= x_l; i--)//左边
{
if (0 == n_max)
{
CircleArray[i][j] = 0;
break;
}
else
{
CircleArray[i][j] = n_max--;
}
if (0 == n_max)//零值出现在最后，特殊处理
{
i = x_l;
j = y_l + 1;
CircleArray[i][j] = 0;
}
}
y_l += 1;
}
for (int p = 0; p < n; p++) //打印数组
{
for (int q = 0; q < n; q++)
{
printf("%4d ",CircleArray[p][q]);
}
printf("\n");
}
system("pause");
return 0;
}