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.15第三次提交，继续修改

Browse Source
This commit is contained in:
氧原子
2025-05-15 22:40:18 +08:00
parent 75f7336601
commit a81594bf68
8 changed files with 63 additions and 55 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
maze_code/maze_func_flood.cpp
View File

@@ -25,36 +25,36 @@ void flood(int *map, int *copy_map, int *copy_wall)
{
if (i > 0)
{
if (!copy_wall[(i * size_y * 2) + (j * 2) + 1] && map[((i-1) * size_y) + j] == -1) //左边格子
if (!copy_wall[(i * (size_y + 1) * 2) + (j * 2) + 1] && map[((i-1) * size_y) + j] == -1) //左边格子
{
copy_map[((i-1) * size_y) + j] = map[(i * size_y) + j] + 1;
map[((i-1) * size_y) + j] = map[(i * size_y) + j] + 1;
num++;
}
}
if (i < size_x - 1)
{
if (!copy_wall[((i+1) * size_y * 2) + (j * 2) + 1] && map[((i+1) * size_y) + j] == -1) //右边格子
if (!copy_wall[((i+1) * (size_y + 1) * 2) + (j * 2) + 1] && map[((i+1) * size_y) + j] == -1) //右边格子
{
copy_map[((i+1) * size_y) + j] = map[(i * size_y) + j] + 1;
map[((i+1) * size_y) + j] = map[(i * size_y) + j] + 1;
num++;
}
}
if (j > 0)
{
if (!copy_wall[(i * size_y * 2) + (j * 2) + 0] && map[(i *size_y) + (j-1)] == -1)
if (!copy_wall[(i * (size_y + 1) * 2) + (j * 2) + 0] && map[(i *size_y) + (j-1)] == -1)
{
copy_map[(i * size_y) + (j-1)] = map[(i * size_y) + j] + 1;
map[(i * size_y) + (j-1)] = map[(i * size_y) + j] + 1;
num++;
}
}
if (j < size_y - 1)
{
if (!copy_wall[(i * size_y * 2) + ((j+1) * 2) + 0] && map[(i * size_y) + (j+1)] == -1)
if (!copy_wall[(i * (size_y + 1) * 2) + ((j+1) * 2) + 0] && map[(i * size_y) + (j+1)] == -1)
{
copy_map[(i * size_y) + (j+1)] = map[(i * size_y) + j] + 1;
map[(i * size_y) + (j+1)] = map[(i * size_y) + j] + 1;
num++;
}
}
@@ -62,12 +62,12 @@ void flood(int *map, int *copy_map, int *copy_wall)
}
}
for (int i = 0; i < size_x; i++)
{
for (int j = 0; j < size_y; j++)
{
map[(i * size_y) + j] = copy_map[(i * size_y) + j];
}
}
// for (int i = 0; i < size_x; i++)
// {
// for (int j = 0; j < size_y; j++)
// {
// map[(i * size_y) + j] = copy_map[(i * size_y) + j];
// }
// }
} while (map[(target_x * size_y) + target_y] == -1 && num < (size_x * size_y));
}