yyz/bk_bishe_pi
1
0
Fork 0
mirror of https://gitee.com/yyz_o/bk_bishe_pi.git synced 2025-09-07 23:21:26 +00:00
Code Issues Packages Projects Releases Wiki Activity

2025.5.14第二次提交，修改完成全部编译时的报错，除部分警告之外。

Browse Source
This commit is contained in:
氧原子
2025-05-14 22:15:27 +08:00
parent 09b6ef759a
commit da75133de4
12 changed files with 115 additions and 151 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
maze_code/maze_func_flood.cpp
View File

@@ -2,8 +2,8 @@
#include<string>
#include<vector>
#include"eyebot++.h"
#include"maze_func.h"
#include"maze_parameter.h"
#include"maze_func.h"
using namespace std;
void flood(int *map, int *copy_map, int *copy_wall)
@@ -11,49 +11,49 @@ void flood(int *map, int *copy_map, int *copy_wall)
int num = 0;
int size_x = mark.size();
int size_y = mark[0].size();
map[0][0] = 0;
copy_map[0][0] = 0;
map[0] = 0;
copy_map[0] = 0;
do
{
for (i = 0; i < size_x; i++)
for (int i = 0; i < size_x; i++)
{
for (j = 0; j < size_y; j++)
for (int j = 0; j < size_y; j++)
{
if (! map[i][j] == -1)
if (map[(i * size_y) + j] != -1)
{
if (i > 0)
{
if (! copy_wall[i][j][1] && map[i-1][j] = -1) //左边格子
if (!copy_wall[(i * size_y * 2) + (j * 2) + 1] && map[((i-1) * size_y) + j] == -1) //左边格子
{
copy_map[i-1][j] = map[i][j] + 1;
copy_map[((i-1) * size_y) + j] = map[(i * size_y) + j] + 1;
num++;
}
}
if (i < size_x - 1)
{
if (! copy_wall[i+1][j][1] && map[i+1][j] = -1) //右边格子
if (!copy_wall[((i+1) * size_y * 2) + (j * 2) + 1] && map[((i+1) * size_y) + j] == -1) //右边格子
{
copy_map[i+1][j] = map[i][j] + 1;
copy_map[((i+1) * size_y) + j] = map[(i * size_y) + j] + 1;
num++;
}
}
if (j > 0)
{
if (! copy_wall[i][j][0] && map[i][j-1] = -1)
if (!copy_wall[(i * size_y * 2) + (j * 2) + 0] && map[(i *size_y) + (j-1)] == -1)
{
copy_map[i][j-1] = map[i][j] + 1;
copy_map[(i * size_y) + (j-1)] = map[(i * size_y) + j] + 1;
num++;
}
}
if (j < size_y - 1)
{
if (! copy_wall[i][j+1][0] && map[i][j+1] = -1)
if (!copy_wall[(i * size_y * 2) + ((j+1) * 2) + 0] && map[(i * size_y) + (j+1)] == -1)
{
copy_map[i][j+1] = map[i][j] + 1;
copy_map[(i * size_y) + (j+1)] = map[(i * size_y) + j] + 1;
num++;
}
}
@@ -61,12 +61,12 @@ void flood(int *map, int *copy_map, int *copy_wall)
}
}
for (i = 0; i < size_x; i++)
for (int i = 0; i < size_x; i++)
{
for (j = 0; j < size_y; j++)
for (int j = 0; j < size_y; j++)
{
map[i][j] = copy_map[i][j];
map[(i * size_y) + j] = copy_map[(i * size_y) + j];
}
}
} while (map[target_x][target_y] == -1 && num < (size_x * size_y))
} while (map[(target_x * size_y) + target_y] == -1 && num < (size_x * size_y));
}