1.代码实现
#include <stdio.h>
#include <stdlib.h>
void visit(int ,int);
int maze[9][9] = {
{2, 2, 2, 2, 2, 2, 2, 2, 2},
{2, 0, 0, 0, 0, 0, 0, 0, 2},
{2, 0, 2, 2, 0, 2, 2, 0, 2},
{2, 0, 2, 0, 0, 2, 0, 0, 2},
{2, 0, 2, 0, 2, 0, 2, 0, 2},
{2, 0, 0, 0, 0, 0, 2, 0, 2},
{2, 2, 0, 2, 2, 0, 2, 2, 2},
{2, 0, 0, 0, 0, 0, 0, 0, 2},
{2, 2, 2, 2, 2, 2, 2, 2, 2}
};
int startI = 1, startJ = 1;
int endI = 7, endJ = 7;
int main(void)
{
int i, j;
printf("显示迷宫: \n");
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(maze[i][j] == 2)
printf("#");
else
printf(" ");
}
printf("\n");
}
visit(startI, startJ);
return 0;
}
void visit(int i, int j)
{
int m, n;
maze[i][j] = 1;