说明：  编写一个程序求解迷宫问题。迷宫由m行n列的二维数组设置，0表示无障碍，1表示有障碍。设入口为（1，1），出口为（m，n），每次只能从一个无障碍单元移到周围四个方向上任一无障碍单元。编程实现对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。 算法输入：代表迷宫入口的坐标 算法输出：穿过迷宫的结果。
(The preparation of a program to solve maze problems. Maze by m lines n set out in two-dimensional array, 0, said barrier-free, 1 that there is an obstacle. Entrance located (1,1), exports (m, n), each from a barrier-free unit can only move in four directions around the office of a barrier-free unit. Programming the maze of arbitrary, derived from the entrance to an export pathway, or no access to draw conclusions. Algorithm input: the representative of the coordinates of the entrance of the maze algorithm output: the results through the maze.)