问题:迷宫问题
0,1,1,1,1,1,1,1,1,1,
1,0,1,1,0,0,0,1,0,1,
1,1,0,0,1,1,0,1,0,1,
1,1,1,1,0,1,1,0,0,1,
1,0,1,1,1,0,1,0,0,1,
1,0,0,0,0,1,1,0,0,1,
1,0,1,0,0,0,0,0,0,1,
1,0,1,0,1,0,1,1,1,1,
1,1,1,0,0,0,0,1,0,1,
1,1,1,1,1,1,1,1,1,0,
入口在[0,0],出口在[9,9],可以往8个方向查找,请写程序找出从入口到出口的路径。
分析:采用传统的栈来解决
maze.h文件:
maze.cpp文件:
main文件: