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.18晚上提交，实机调试后的代码，有一次成功了，但是后面没复现了，很奇怪

Browse Source
This commit is contained in:
Ñõԭ×Ó
2025-05-18 22:47:24 +08:00
parent 1155ae6f6d
commit 00e0d9366d
13 changed files with 129 additions and 124 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
bot_code/maze_func_explore.cpp
View File

@@ -104,14 +104,16 @@ void maze_entry(int x, int y, int dir, int open)
{
if (!mark.empty() && !wall.empty()) //插入安全性检测，确保容器非空
{
// std::vector<int> mark_insert(mark[0].size(), 0);
// mark.insert(mark.begin(), mark_insert);
//~ std::vector<int> mark_insert(mark[0].size(), 0);
//~ mark.insert(mark.begin(), mark_insert);
// std::vector<std::vector<int>> wall_insert(wall[0].size(), std::vector<int>(2,0));
// wall.insert(wall.begin(), wall_insert);
//~ std::vector<std::vector<int>> wall_insert(wall[0].size(), std::vector<int>(2,0));
//~ wall.insert(wall.begin(), wall_insert);
mark.emplace(mark.begin(), std::vector<int>(mark[0].size(), 0)); //在mark头部插入一个内层
wall.emplace(wall.begin(), std::vector<std::vector<int>>(wall[0].size(), std::vector<int>(2, 0))); //在wall头部插入一个内层
rob_x++;
rob_x0++;
}
else
{
@@ -134,6 +136,8 @@ void maze_entry(int x, int y, int dir, int open)
{
wall[i].emplace(wall[i].begin(), std::vector<int>(2,0));
}
rob_y++;
rob_y0++;
}
else
{