应用栈求迷宫通路，用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向再继续探索，直至探索到通路为止。-Application stack requirements maze path, using a "brute-force solving" approach, starting from the entrance, along a forward direction to explore, if we go through, then continue to move forward　otherwise return along the same route, for a direction Continue to explore, explore to access up to date.