使用非递归算法解决迷宫问题

 问题：迷宫问题

    0,1,1,1,1,1,1,1,1,1,
    1,0,1,1,0,0,0,1,0,1,
    1,1,0,0,1,1,0,1,0,1,
    1,1,1,1,0,1,1,0,0,1,
    1,0,1,1,1,0,1,0,0,1,
    1,0,0,0,0,1,1,0,0,1,
    1,0,1,0,0,0,0,0,0,1,
    1,0,1,0,1,0,1,1,1,1,
    1,1,1,0,0,0,0,1,0,1,
    1,1,1,1,1,1,1,1,1,0,

入口在[0,0]，出口在[9,9]，可以往8个方向查找，请写程序找出从入口到出口的路径。

 

分析：采用传统的栈来解决

 

maze.h文件：

#include <stdio.h> #include <malloc.h> //保存路径的节点信息 class PathNode { public: int x; int y; int direction; //1-right 2-right down 3-down 4-down left 5-left 6-left up 7-up 8-up right public: PathNode(int x, int y, int dir = 1):x(x),y(y),direction(dir){} }; //栈节点数据结构 class StackNode { friend class Stack; private: PathNode path; StackNode *next; //构造函数 StackNode(PathNode node, StackNode *p):path(node),next(p){} }; //栈 class Stack { private: StackNode *top; public: Stack():top(NULL){} ~Stack(); void push(PathNode node); PathNode pop(); bool isEmpty(){return top == NULL;} PathNode getTop(); }; class Maze { private: int **maze; const int sizeX; const int sizeY; private: Stack mazeStack; public: Maze(const int x, const int y):sizeX(x),sizeY(y) { int i; maze = new int* [sizeY]; for (i = 0; i<sizeY; i++) { maze[i] = new int[sizeX]; } } ~Maze() { int i; for (i = 0; i<sizeY; i++) { delete [] maze[i]; } delete [] maze; } void newMaze(int *oldMaze, int x, int y); int findPath(); void printPath(); }; #define NOTFOUND -1 #define SUCCESS 0

 

maze.cpp文件：

#include "maze.h" Stack::~Stack() { StackNode *p; while (NULL != top) { p = top; top = top->next; delete p; } } void Stack::push(PathNode node) { top = new StackNode(node,top); } PathNode Stack::pop() { if (!isEmpty()) { StackNode *p; p = top; top = top->next; PathNode node = p->path; delete p; return node; } } PathNode Stack::getTop() { return top->path; } //把迷宫加上边框 void Maze::newMaze(int *oldMaze, int x, int y) { int i, j; for (i = 0; i < sizeX; i++) { for (j = 0; j < sizeY; j++) { maze[i][j] = 1; } } for (i = 0; i < x; i++) { for (j = 0; j < y; j++) { maze[i+1][j+1] = *((oldMaze+i*y)+j); //printf("%d ", *((oldMaze+i*y)+j)); } //printf("/n"); } printf("-------------------/n"); for (i = 0; i < sizeX; i++) { for (j = 0; j < sizeY; j++) { printf("%d ", maze[i][j]); } printf("/n"); } printf("-------------------/n"); } int Maze::findPath() { //从入口处开始查找路径 int x = 1; int y = 1; int dir = 1; //先向右查找路径 PathNode first = PathNode(x, x, dir); mazeStack.push(first); //查找过的节点值置成2 maze[1][1] = 2; PathNode path = mazeStack.getTop(); while (true) { //已经查找到出口 if (path.x == sizeX-2 && path.y == sizeY-2) { printPath(); return SUCCESS; } else if (path.direction <= 8) { switch (path.direction) { case 1: { if (0 == maze[path.x][path.y+1]) { //查找过的节点值置成2 maze[path.x][path.y+1] = 2; PathNode node = PathNode(path.x, path.y+1); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } case 2: { if (0 == maze[path.x+1][path.y+1]) { //查找过的节点值置成2 maze[path.x+1][path.y+1] = 2; PathNode node = PathNode(path.x+1, path.y+1); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } case 3: { if (0 == maze[path.x+1][path.y]) { //查找过的节点值置成2 maze[path.x+1][path.y] = 2; PathNode node = PathNode(path.x+1, path.y); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } case 4: { if (0 == maze[path.x+1][path.y-1]) { //查找过的节点值置成2 maze[path.x+1][path.y-1] = 2; PathNode node = PathNode(path.x+1, path.y-1); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } case 5: { if (0 == maze[path.x][path.y-1]) { //查找过的节点值置成2 maze[path.x][path.y-1] = 2; PathNode node = PathNode(path.x, path.y-1); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } case 6: { if (0 == maze[path.x-1][path.y-1]) { //查找过的节点值置成2 maze[path.x-1][path.y-1] = 2; PathNode node = PathNode(path.x-1, path.y-1); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } case 7: { if (0 == maze[path.x-1][path.y]) { //查找过的节点值置成2 maze[path.x-1][path.y] = 2; PathNode node = PathNode(path.x-1, path.y); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } case 8: { if (0 == maze[path.x-1][path.y+1]) { //查找过的节点值置成2 maze[path.x-1][path.y+1] = 2; PathNode node = PathNode(path.x-1, path.y+1); mazeStack.push(node); path = mazeStack.getTop(); } else { path.direction += 1; } break; } } } else { mazeStack.pop(); if (mazeStack.isEmpty()) { return NOTFOUND; } path = mazeStack.getTop(); } } } void Maze::printPath() { printf("the way is:/n"); while (!mazeStack.isEmpty()) { PathNode node = mazeStack.pop(); printf("[ %d, %d ]/n",node.x-1, node.y-1); } }

 

main文件：

#include "maze.h" int main() { int maze[10][10]={0,1,1,1,1,1,1,1,1,1, 1,0,1,1,0,0,0,1,0,1, 1,1,0,0,1,1,0,1,0,1, 1,1,1,1,0,1,1,0,0,1, 1,0,1,1,1,0,1,0,0,1, 1,0,0,0,0,1,1,0,0,1, 1,0,1,0,0,0,0,0,0,1, 1,0,1,0,1,0,1,1,1,1, 1,1,1,0,0,0,0,1,0,1, 1,1,1,1,1,1,1,1,1,0,}; Maze m = Maze(10+2,10+2); m.newMaze(&maze[0][0], 10, 10); if (NOTFOUND == m.findPath()) { printf("there is no way./n"); } getchar(); }