老鼠走迷宫（1）输出唯一路径（C语言）

 1 #include <stdio.h>
 2 
 3 int maze[9][9] = {
 4     {2, 2, 2, 2, 2, 2, 2, 2, 2},
 5     {0, 0, 2, 2, 2, 2, 0, 2, 2},
 6     {2, 0, 0, 0, 0, 0, 0, 0, 2},
 7     {2, 0, 2, 2, 0, 2, 2, 0, 2},
 8     {0, 2, 0, 2, 0, 2, 2, 0, 2},
 9     {2, 2, 0, 2, 0, 2, 2, 0, 2},
10     {2, 2, 0, 2, 0, 0, 0, 0, 2},
11     {2, 2, 0, 2, 0, 2, 2, 2, 2},
12     {2, 2, 2, 2, 0, 2, 2, 2, 2},
13 };                                          //构建迷宫
14 
15 int start_x = 1, start_y = 0;               //设置起点
16 int end_x = 8, end_y = 4;                   //设置终点
17 int success = 0;
18 
19 int step(int x, int y);
20 
21 int main(int argc, char argv[])
22 {
23     int x, y;    
24 
25     printf("maze:\n");                    //打印迷宫图，为方便查看，将数字换为图形打印
26     for(x = 0; x < 9; x++)
27     {
28         for(y = 0; y < 9; y++)
29         {
30             if(maze[x][y] == 2)
31                 printf("■");
32             else
33                 printf("□");
34         }
35         printf("\n");
36     }
37 
38     if(step(start_x, start_y) == 0)
39     {
40         printf("No way!\n");
41     }
42     else
43     {
44         printf("You are free!\n");
45     
46         for(x = 0; x < 9; x++)
47         {
48             for(y = 0; y < 9; y++)
49             {
50                 if(maze[x][y] == 2)
51                     printf("■");
52                 else if(maze[x][y] == 1) 
53                     printf("☆");
54                 else
55                     printf("□");
56             }
57         printf("\n");
58         }
59     }
60 
61     printf("\n");
62     return 0;
63 }
64 
65 
66 int step(int x, int y)           //用递归算法求解路径                 
67 {
68     maze[x][y] = 1;
69 
70     if(x == end_x && y == end_y)
71     {
72         success = 1;
73     }
74 
75     if(success != 1 && maze[x][y + 1] == 0){step(x, y + 1);}
76     if(success != 1 && maze[x][y - 1] == 0){step(x, y - 1);}
77     if(success != 1 && maze[x + 1][y] == 0){step(x + 1, y);}
78     if(success != 1 && maze[x - 1][y] == 0){step(x - 1, y);}
79 
80     if(success != 1)
81     {
82         maze[x][y] = 0;
83     }
84 
85     return success;
86 }