简易的走迷宫c语言解法吧

#include <stdio.h>
#include <stdlib.h>
#include <windows.h>
int main()
{
char a[50][50]={“##################”,
“#o # # # “,
“# ## # ## ## #####”,
“# # # ## ## # #”,
“## # ## # #”,
“#### # # ## # ###”,
“# # # ## # # # #”,
“## # # # #”,
“##################”,};
int i,x,y,p,q;
char ch;
x=1;y=1;p=1;q=18;
for(i=0;i<=18;i++)
puts(a[i]);
while(x!=p||y!=q){
ch=getch();
if(ch==’s’)
{
if(a[x+1][y]!=’#’)
{
a[x][y]=’ ‘;
x++;
a[x][y]=’o’;
}
}
if(ch==’w’)
{
if(a[x-1][y]!=’#’)
{
a[x][y]=’ ‘;
x–;
a[x][y]=’o’;
}
}
if(ch==’a’)
{
if(a[x][y-1]!=’#’)
{
a[x][y]=’ ‘;
y–;
a[x][y]=’o’;
}
}
if(ch==’d’)
{
if(a[x][y+1]!=’#’)
{
a[x][y]=’ ‘;
y++;
a[x][y]=’o’;
}
}
system(“cls”);
for(i=0;i<=18;i++)
puts(a[i]);
}
system(“cls”);
printf(“win\n”);
Sleep(5000);
return 0;
}

本文出自:https://www.52pojie.cn/forum.php?mod=viewthread&tid=1831736&extra=page%3D1%26filter%3Dauthor%26orderby%3Ddateline