本程序主要是用栈来实现迷宫问题。所用算法是非递归算法，输入为迷宫的行数和列数，然后在对应位置上输入其值（0表示该位置通，1表示该位置不通）。输出则是以三元组（i,j,d）的形式,其中(i,j)表示迷宫中的一个坐标，d表示走到下一坐标的方向，-This procedure is mainly used to achieve the maze problem stack. Algorithm used in a non-recursive algorithm, enter the number of rows for the maze and the number of rows, and then enter the location in the corresponding value (0 indicates that the location of Qualcomm, said the location of a barrier). Output is based on triples (i, j, d) form, in which (i, j) that one of the coordinates of the maze, d that the next go the direction of coordinates,