有一个迷宫，用一个二维数组maze[1: m][1: n]表示，其元素值只有两个：0与1。其中以值0表示该位置可以走通，以值1表示该位置阻塞。在迷宫的左上方maze[1][1]处有一入口，右下方maze[m][n]处有一出口，如图1-1所示。现要求探寻从迷宫入口到出口有无通路；若有，则指出其中一条通路的路径：将迷宫数组中通路上的0替换成另一数字(例如8),输出找到通路的迷宫数组；同时按照走通的顺序输出路径上每一步的位置坐标及向下一步前进的方向；若没有，则给出相应的信息。-There is a maze, with a two-dimensional array maze [1: m] [1: n] that the value of its only two elements: 0 and 1. Among them, the location of the value of 0 indicates that the pass can go to the value of 1 indicates that the location of obstruction. The upper left corner in the maze of the maze [1] [1] there is a entrance to the lower right corner maze [m] [n] there is an export, as shown in Figure 1-1. Are now required to explore the maze entrance to the exit from the availability of access　if so, have pointed out that one of the access path: The path of the maze array of 0 replaced by another number (eg 8), the output pathway of the maze to find the array　At the same time, in accordance with the walk pass on the order of the output path of the location coordinates of each step and the way forward to the next step　if not, then given the appropriate information.