C++ 迷宫寻路（非递归实时效果演示进栈退栈过程）

最新推荐文章于 2023-07-15 10:34:41 发布

weixin_54481960

最新推荐文章于 2023-07-15 10:34:41 发布

阅读量316

点赞数

文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/weixin_54481960/article/details/125923435

版权

#include<iostream>
#include<stack>
#include<windows.h>
using namespace std;

const int n = 10;
const int m = 10;

struct node {
int g;
int h;
};

int Mark[n + 2][m + 2] = {0};
int Maze[n + 2][m + 2] = {
   {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
   {1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1},
   {1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1},
   {1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1},
   {1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1},
   {1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1},
   {1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1},
   {1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1},
   {1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1},
   {1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1},
   {1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1},
   {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}
};

int Move[4][2] = {
   {0 , 1},
   {1 , 0},
   {0 , -1},
   {-1, 0}
};

stack <node> s;

void f() {
   system("cls");
   for(int i = 0; i < n + 2; i++) {
       for(int j = 0; j < m + 2; j++) {
           if(Maze[i][j] == 1)
               cout << "■";
           else if( Maze[i][j] == 0)
               cout << " ";
           else
               cout<< "☆";
       }
       cout << endl;
   }Sleep(500);
}

void SeekPath(int x, int y) {
   node a; a.g = x; a.h = y; s.push(a);
   Mark[a.g][a.h] = 1;
   Maze[a.g][a.h] = 2;f();
   while(1) {
       node b = s.top();
       if(b.g == n && b.h == m) {
           break;
       }
       int i,g,h;
       for(i = 0; i < 4; i++) {
           g = b.g + Move[i][0];
           h = b.h + Move[i][1];
           if(Maze[g][h] == 0 && Mark[g][h] == 0) {
               Mark[g][h] = 1;
               Maze[g][h] = 2;
               node k ; k.g = g; k.h = h;
               s.push(k);
               break;
           }
       }f();
       if(i == 4) {
           s.pop();
           Maze[b.g][b.h] = 0; f();
       }
   }
}
int main() {
   SeekPath(1,1);
   return 0;
}