在迷宫问题中，我们需要解决的第一个问题，也是老师布置给我们的作业就是从我们是否能从迷宫的起点到终点找到一条不间断的通路。这时我们的基本想法就是定义一个数组maze[1000][1000]，将无法走到的地方即墙标记为0，能走到的地方标记为1。这时我们规定一个走的顺序，先向右走，如果向右走不通就向上走，都不行就向左，最后选择向下，如果到了一个格子，这个格子四个方向均走不通，则宣告这条路失败。(In the maze problem, the first problem we need to solve is the assignment given to us by the teacher, which is whether we can find an uninterrupted passage from the beginning to the end of the maze. Then our basic idea is to define an array maze[1000][1000] that will not be able to go where the wall is marked 0 and can go where it is marked as 1. Then we set a go order, first go to the right, if not to walk on the right, not left, finally down, if to a grid, the grid in four directions was dead, that is the way of failure.)相关搜索： c
C++
迷宫