#include#includeint main()
{
int i,j,n,number[10][10],count=1;
scanf("%d",&n);
for(i=0;i<=n/2;i++)
{
for(j=i;ji;j--)//back; 5 > 0
number[n-i-1][j]=count++; //65,64,63,62,61,60;
for(j=n-i-1;j>i;j--)//up
number[j][i]=count++;//50.40.30.20.00.
}
for(i=0;i
(0.0) (0.6)
1 2 3 4 5 6 7
24 25 26 27 28 29 8
23 40 41 42 43 30 9
22 39 48 49 44 31 10
21 38 47 46 45 32 11
20 37 36 35 34 33 12
19 18 17 16 15 14 13
(6.0) (6.6)
--------------------------------
Process exited after 1.789 seconds with return value 0
请按任意键继续. . .
正序打印螺旋矩阵,思路就是外层大循环获得螺旋次数;
里面从前开始打印然后减i位打印向下,在自减i位打印向上,在