#include<stdlib.h>
#define MAX_Z 10
#define MAX_X 3
#define MAX_Y 100
struct find_w
{
int x;
int y;
};
int main(void)
{
struct find_w stack[MAX_Y];
int i;
int j;
int m;
int n;
m=1;
n=1;
int count;
count=0;
int painter[MAX_Z][MAX_Z];
for(i=0;i<MAX_Z;i++)
for(j=0;j<MAX_Z;j++)
painter[i][j]=rand()%2;
i=0;
for(j=0;j<MAX_Z;j++)
{
painter[i][j]=1;
painter[j][i]=1;
}
i=MAX_Z-1;
for(j=0;j<MAX_Z;j++)
painter[j][i]=1;
i=MAX_Z-1;
for(j=0;j<MAX_Z;j++)
painter[i][j]=1;
painter[1][1]=0;
painter[MAX_Z-2][MAX_Z-2]=0;
for(i=0;i<MAX_Z;i++)
{
for(j=0;j<MAX_Z;j++)
printf("%d",painter[i][j]);
printf("\n");
}
while(m!=(MAX_Z-2)&&n!=(MAX_Z-2)) //当 mn 不为 出口时 不断循环
{
if(painter[m-1][n]==0) // 检测 下一点为 0时 可以走
{
painter[m][n]=1; // 把走过的位置标记为1
stack[count].x=m;// 用栈 记录走过的点
stack[count].y=n;
count++;
m--;
}
else if(painter[m][n-1]==0)
{
painter[m][n]=1;
stack[count].x=m;
stack[count].y=n;
count++;
n--;
}
else if(painter[m][n+1]==0)
{
painter[m][n]=1;
stack[count].x=m;
stack[count].y=n;
count++;
n++;
}
else if(painter[m+1][n]==0)
{
painter[m][n]=1;
stack[count].x=m;
stack[count].y=n;
count++;
m++;
}
else //当上下左右都不能走时 退栈 把 将该点标记 为 0
{
painter[m][n]=1;
count--;
m=stack[count].x;
n=stack[count].y;
painter[m][n]=0;
}
}
for(i=0;i<count;i++)
{
printf("<%d",stack[i].x);
printf("%d>",stack[i].y);
}
return 0;
}
