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

42
maze_code/maze_func_array.cpp
View File

@@ -2,33 +2,18 @@
#include<string>
#include<vector>
#include"eyebot++.h"
#include"maze_func.h"
#include"maze_parameter.h"
#include"maze_func.h"
using namespace std;
/*---将二维数组初始化为-1---*/
void array_negative_one(int *arr)
{
int rows = sizeof(arr) / sizeof(arr[0]); //获取X轴长度
int cols = sizeof(arr[0]) / sizeof(arr[0][0]); //获取Y轴长度
for (i = 0; i < rows; i++)
{
for (j = 0; j < cols; j++)
{
arr[i][j] = -1;
}
}
}
/*---从vector容器复制mark信息到数组函数---*/
void array_copy_mark(int size_x, int size_y, int *copy_mark)
{
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++)
{
copy_mark[i][j] = mark[i][j];
copy_mark[i * size_y + j] = mark[i][j];
}
}
}
@@ -36,14 +21,25 @@ void array_copy_mark(int size_x, int size_y, int *copy_mark)
/*---从vector容器复制wall信息到数组函数---*/
void array_copy_wall(int size_x, int size_y, 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++)
{
for(k = 0; k < 2; k++)
for(int k = 0; k < 2; k++)
{
copy_wall[i][j][k] = wall[i][j][k];
copy_wall[i * size_y * 2 + j * 2 + k] = wall[i][j][k];
}
}
}
}
/*---将二维数组初始化为-1---*/
void array_negative_one(int *arr)
{
int size = sizeof(arr) / sizeof(arr[0]); //获取X轴长度
for (int i = 0; i < size; i++)
{
arr[i] = -1;
}
}