//by stona126
#include<stdio.h>
#define up 1
#define down 2
#define left 3
#define right 4
#define N 5
//逆向打印
int flag(int a,int b,int c,int d)//1,up,2,down,3,left,4,right array[a][b],array[c][d]; 此函数用来判断该拐的方向;
{
if(a == c)
{
if(b > d)
return up;
else if(b < d)
return down;
}
else if(a > c)
return right;
else if(a < c)
return left;
}
int main()
{
int a[N][N]={0};
int i = 0,j = 0;
int m1 = 0,m2 = 0,n1 = 0,n2 = 0;//m1,n1记录前一个数的下标,m2,n2记录当前数的下标
int total = 1;
int sum = 1;
for(i = 0;i<N;i++)
{
m1 = m2;
n1 = n2;
a[i][N-1] = total++;
printf("a[%d][%d]=%d",i,N-1,total-1);
m2 = i;
n2 = N - 1;
printf("(m1=%d,n1=%d),(m2=%d,n2=%d)/n",m1,n1,m2,n2);
}
for(i = 0;i < N ;i++)
{
for(j = 0;j < N;j++)
{
printf("%-5d",a[i][j]);
}
printf("/n");
}
while((total<=N*N)&&(sum<=N*N))
{
sum++;
if(flag(m1,n1,m2,n2)==left) //每当走到头时就判断一次方向
{
printf("flag=%d/n",flag(m1,n1,m2,n2));
for(i = n2-1;((a[m2][i]==0)&&(i>=0));i--)
{
m1 = m2;
n1 = n2;
a[m2][i] = total++;
printf("a[%d][%d]=%d",m2,i,total-1);
m2 = m2;
n2 = i;
printf("(m1=%d,n1=%d),(m2=%d,n2=%d)/n",m1,n1,m2,n2);
}
}
else if(flag(m1,n1,m2,n2)==right)
{
printf("flag=%d/n",flag(m1,n1,m2,n2));
for(i = n2+1;((a[m2][i]==0)&&(i<N));i++)
{
m1 = m2;
n1 = n2;
a[m2][i] = total++;
printf("a[%d][%d]=%d",m2,i,total-1);
m2 = m2;
n2 = i;
printf("(m1=%d,n1=%d),(m2=%d,n2=%d)/n",m1,n1,m2,n2);
}
}
else if(flag(m1,n1,m2,n2)==up)
{
printf("flag=%d/n",flag(m1,n1,m2,n2));
for(i = m2-1;((a[i][n2]==0)&&(i>=0));i--)
{
m1 = m2;
n1 = n2;
a[i][n2] = total++;
printf("a[%d][%d]=%d",i,n2,total-1);
m2 = i;
n2 = n2;
printf("(m1=%d,n1=%d),(m2=%d,n2=%d)/n",m1,n1,m2,n2);
}
}
else if(flag(m1,n1,m2,n2)==down)
{
printf("flag=%d/n",flag(m1,n1,m2,n2));
for(i = m2+1;((a[i][n2]==0)&&(i<N));i++)
{
m1 = m2;
n1 = n2;
a[i][n2] = total++;
printf("a[%d][%d]=%d",i,n2,total-1);
m2 = i;
n2 = n2;
printf("(m1=%d,n1=%d),(m2=%d,n2=%d)/n",m1,n1,m2,n2);
}
}
}
for(i = 0;i < N ;i++)
{
for(j = 0;j < N;j++)
{
printf("%-5d",a[i][j]);
}
printf("/n");
}
return 0;
}