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

最新推荐文章于 2024-02-03 08:07:54 发布

weixin_54481960

最新推荐文章于 2024-02-03 08:07:54 发布

阅读量356

点赞数

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

本文链接：https://blog.youkuaiyun.com/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] &#