mirror of
https://gitee.com/yyz_o/bk_bishe_pi.git
synced 2025-09-07 23:21:26 +00:00
第一次提交
This commit is contained in:
49
maze_code/maze_func_array.cpp
Normal file
49
maze_code/maze_func_array.cpp
Normal file
@@ -0,0 +1,49 @@
|
||||
#include<iostream>
|
||||
#include<string>
|
||||
#include<vector>
|
||||
#include"eyebot++.h"
|
||||
#include"maze_func.h"
|
||||
#include"maze_parameter.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 (j = 0; j < size_y; j++)
|
||||
{
|
||||
copy_mark[i][j] = mark[i][j];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/*---从vector容器复制wall信息到数组函数---*/
|
||||
void array_copy_wall(int size_x, int size_y, int *copy_wall)
|
||||
{
|
||||
for (i = 0; i <= size_x; i++)
|
||||
{
|
||||
for (j = 0; j <= size_y; j++)
|
||||
{
|
||||
for(k = 0; k < 2; k++)
|
||||
{
|
||||
copy_wall[i][j][k] = wall[i][j][k];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user