扫二维码与项目经理沟通
我们在微信上24小时期待你的声音
解答本文疑问/技术咨询/运营咨询/技术建议/互联网交流
#include#include #include #include struct Pos { int _row; int _col; }; bool MinPath(vector >& maze, int row, int col, Pos enrty, stack & minPath) { assert(!maze.empty()); stack path; bool firstOrNo = true; vector > tmp = maze; while (maze[enrty._row][enrty._col] != 3) { tmp = maze; path.push(enrty); while (!path.empty()) { Pos cur = path.top(); tmp[cur._row][cur._col] = 2; if (path.top()._row == row - 1) { maze[path.top()._row][path.top()._col] = 4; if (firstOrNo || path.size() < minPath.size()) { minPath = path; firstOrNo = false; } while (!path.empty()) { path.pop(); } break; } //上 Pos next = cur; next._row--; if (next._row >= 0 && next._row < row &&next._col >= 0 && next._col < col &&tmp[next._row][next._col] == 0) { path.push(next); continue; } //下 next = cur; next._row++; if (next._row >= 0 && next._row < row &&next._col >= 0 && next._col < col &&tmp[next._row][next._col] == 0) { path.push(next); continue; } //左 next = cur; next._col--; if (next._row >= 0 && next._row < row &&next._col >= 0 && next._col < col &&tmp[next._row][next._col] == 0) { path.push(next); continue; } //右 next = cur; next._col++; if (next._row >= 0 && next._row < row &&next._col >= 0 && next._col < col &&tmp[next._row][next._col] == 0) { path.push(next); continue; } maze[path.top()._row][path.top()._col] = 3; path.pop(); }//while !empty(path) } //while 大 //在地图中标出最短路径 stack p = minPath; while (!p.empty()) { maze[p.top()._row][p.top()._col] = 2; p.pop(); } return !minPath.empty(); }
我们在微信上24小时期待你的声音
解答本文疑问/技术咨询/运营咨询/技术建议/互联网交流