说明：  设二维数组maze[m][n]为0 表示此路可通,为1表示此路不通.入口是maze[1][1]出口为maze[m][n]且maze[1][1]=0, maze[m][n]=0. 编写寻找从入口到出口的一条最短路径的程序
(Based two-dimensional array maze [m] [n] to 0 indicates that this road may pass, as 1 said that being the case. Entrance is maze [1] [1] export-maze [m] [n] and maze [1] [ 1] = 0, maze [m] [n] = 0. written from the entrance to find a shortest path to the exit program)