题目：假设迷宫由m行n列构成，有一个入口和一个出口，入口坐标为(1，1)，出口坐标为(m，n)，试找出一条从入口通往出口的最短路径。设计算法并编程输出一条通过迷宫的最短路径或报告一个“无法通过”的信息。

要求：用栈和队列实现，不允许使用递归算法。



一、　　需求分析

-Topic: Assuming maze consisting of m rows and n columns form, having an inlet and an outlet, the inlet coordinates (1,1), the export coordinates (m, n), try to find an exit from the entrance to the shortest path. Design algorithms and program outputs a shortest path through a maze or to report a " not pass"　information. Requirements: The stack and queue implementations are not allowed to use recursive algorithm. First, the needs analysis