mirror of
https://gitee.com/yyz_o/bk_bishe_pi.git
synced 2025-09-07 23:21:26 +00:00
42 lines
1.1 KiB
C++
42 lines
1.1 KiB
C++
#include<iostream>
|
||
#include<string>
|
||
#include<vector>
|
||
#include"eyebot++.h"
|
||
#include"maze_parameter.h"
|
||
#include"maze_func.h"
|
||
using namespace std;
|
||
|
||
/*---从vector容器复制mark信息到数组函数---*/
|
||
void array_copy_mark(int size_x, int size_y, int *copy_mark)
|
||
{
|
||
for (int i = 0; i < size_x; i++)
|
||
{
|
||
for (int j = 0; j < size_y; j++)
|
||
{
|
||
copy_mark[i * size_y + j] = mark[i][j];
|
||
}
|
||
}
|
||
}
|
||
|
||
/*---从vector容器复制wall信息到数组函数---*/
|
||
void array_copy_wall(int size_x, int size_y, int *copy_wall)
|
||
{
|
||
for (int i = 0; i <= size_x; i++)
|
||
{
|
||
for (int j = 0; j <= size_y; j++)
|
||
{
|
||
for(int k = 0; k < 2; k++)
|
||
{
|
||
copy_wall[i * (size_y + 1) * 2 + j * 2 + k] = wall[i][j][k]; //注释:k = 0记录的是单元格下方的数据,1记录的是单元格左边的数据,所以转为一维数组后,i*...+j*...+k,k=1为左侧数据,k=0为下方墙壁。
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
void array_negative_one(int size, int *arr) //将数组初始化为-1
|
||
{
|
||
for (int i = 0; i < size; i++)
|
||
{
|
||
arr[i] = -1;
|
||
}
|
||
} |