求两点路径是一个数据结构上的典型的迷宫问题，很多数据结构的书上都有介绍，解决办法如下：从一点开始出发，向四个方向查找，每走一步，把走过的点的值+1(即本节点值+1)，防止重复行走，并把走过的点压入堆栈(表示路径)，如果遇到墙、或者已走过的点则不能前进…… -Seeking two path is a data structure of a typical maze, a lot of books on data structures are introduced, the solution is as follows: From the beginning point proceed to the four directions to find, at every step, the points traversed value+1 (ie, the value of this node,+1), to prevent duplication of walking, and to the point pressure came into the stack (for paths), if you encounter the wall, or has passed the point it can not move forward ... ...