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

26
maze_code/maze_func_output.cpp
View File

@@ -2,39 +2,35 @@
#include<string>
#include<vector>
#include"eyebot++.h"
#include"maze_func.h"
#include"maze_parameter.h"
#include"maze_func.h"
using namespace std;
/*---打印数组检查错误---*/
/*---打印数组mark,map,copy_map等二维数组所用的函数---*/
void output_arr2D(int *arr)
void output_arr2D(int size_x, int size_y, int *arr)
{
int rows = sizeof(arr) / sizeof(arr[0]);
int cols = sizeof(arr[0]) / sizeof(arr[0][0]);
for (int i = cols - 1; i >= 0; i--)
for (int i = size_y - 1; i >= 0; i--)
{
for (int j = 0; j < rows; j++)
for (int j = 0; j < size_x; j++)
{
cout << arr[j][i] << " ";
cout << arr[(j * size_y) + i] << " ";
}
cout << endl;
}
}
/*---打印数组wall---*/
void output_arrwall(int *arr)
void output_arrwall(int size_x, int size_y, int *arr)
{
int rows = sizeof(arr) / sizeof(arr[0]);
int cols = sizeof(arr[0]) / sizeof(arr[0][0]);
for (int i = cols - 1; i >= 0; i--)
for (int i = size_y - 1; i >= 0; i--)
{
for (int j = 0; j < rows; j++)
for (int j = 0; j < size_x; j++)
{
if (arr[j][i][1] == 1)
if (arr[(j * size_y * 2) + (i * 2) + 1] == 1)
{
cout << "|" ;
}
@@ -43,7 +39,7 @@ void output_arrwall(int *arr)
cout << " " ;
}
if (arr[j][i][0] == 1)
if (arr[(j * size_y * 2) + (i * 2) + 0] == 1)
{
cout << "_" ;
}
@@ -61,7 +57,7 @@ void output_arrpath(int *arr)
{
int size = sizeof(arr) / sizeof(arr[0]);
for (i = 0; i < size; i++)
for (int i = 0; i < size; i++)
{
cout << arr[i] << " ";
}