说明：  迷宫问题，首先自定义建立迷宫的数据结构,迷宫数据放入矩阵中.在路线查找时,初始化栈,应用循环对每一点座标进行4个方向的判断,如果该点可达则把该点信息放入栈内,或者回溯到出栈后的坐标点,最后如果最后能够到达出口,那么栈内存储的即为走出迷宫路径
(Maze problem, first of all, since the definition of the establishment of a maze of data structure, a maze of data Add matrix. Look at the line, the initialization stack, application cycle coordinates for each point on the four directions to determine, if the points put up Add to stack the point of information, or go back to the coordinates of a point after the stack, and finally to reach the final if the export, then the stack is stored in the path out of the maze)