<分区>
我的程序有这个小问题。在 Visual Studio 2012 中它运行良好，但如果我用 G++ 编译它(是的，由于上述原因，我必须使用它来编译)，根据输入触发错误信号 11(SIGSEGV) 或 6(SIGABRT) .这是一个编程练习，我有另一个程序(在在线服务器上)用 10 个不同的输入测试我的程序。正如我所说，该程序在使用 Visual Studio 2012 时编译并运行良好。
关于项目: 它找到从起点 (x,y) 到多个导出的最短路径(导出的数量无关紧要且不同。可能只有 1 个导出，也可能有 200 个)。 输入如下:
7 12 // maze height and width
##########.# //
#..........# //
#.###.###### //
#..X#.#..... // the maze blueprint
#.###.#.#### //
#..........# //
############ //
还有我的程序:
#include <iostream>
#include <vector>
typedef struct _laby_t {
int h, w;
char **pohja; // 'pohja' is finnish and means layout
} laby_t;
typedef std::vector<int> monovector;
typedef std::vector< std::vector<int> > bivector;
laby_t *laby_allocate (int r, int c)
{
laby_t *laby;
int i;
laby = new laby_t[sizeof (laby_t)];
laby->pohja = new char *[r];
for (i = 0; i < r; i++)
{
laby->pohja[i] = new char[c];
}
laby->h = r;
laby->w = c;
return laby;
}
int wander(int y, int x, laby_t *&_laby, int goals)
{
laby_t *laby = _laby;
int found = 0, depth = 0, min_path = 1000000;
bool b = 0;
bivector openList;
monovector start; start.push_back(y); start.push_back(x);
bivector closedList;
openList.push_back(start);
while(found < goals)
{
y = openList.back()[0]; x = openList.back()[1];
monovector r; r.push_back(y); r.push_back(x); closedList.push_back(r);
openList.pop_back();
if(laby->pohja[y][x] != '*') laby->pohja[y][x] = '-';
depth++;
if(y == 0 || y+1 == laby->h || x == 0 || x+1 == laby->w) {
found++;
if(depth < min_path) min_path = depth;
if(found >= goals) {
std::cout << min_path << std::endl;
break;
}
laby->pohja[y][x] = '-';
goto back_track;
}
else
{
b = 0;
if(laby->pohja[y+1][x ] == '.') { monovector r; r.push_back(y+1); r.push_back(x); openList.push_back(r); b=1; }
if(laby->pohja[y ][x+1] == '.') { monovector r; r.push_back(y); r.push_back(x+1); openList.push_back(r); b=1; }
if(laby->pohja[y-1][x ] == '.') { monovector r; r.push_back(y-1); r.push_back(x); openList.push_back(r); b=1; }
if(laby->pohja[y ][x-1] == '.') { monovector r; r.push_back(y); r.push_back(x-1); openList.push_back(r); b=1; }
if(!b)
{
back_track: while(closedList.size() > 0)
{
//std::cout << closedList.size() << std::endl;
int c_y = closedList.back()[0]; int c_x = closedList.back()[1];
int o_y = openList.back()[0]; int o_x = openList.back()[1];
laby->pohja[y][x] = '*';
y = c_y; x = c_x;
laby->pohja[y][x] = '*';
if( (c_y+1 == o_y && c_x == o_x) ||
(c_y == o_y && c_x+1 == o_x) ||
(c_y-1 == o_y && c_x == o_x) ||
(c_y == o_y && c_x-1 == o_x) )
{
laby->pohja[y][x] = '-';
y = o_y; x = o_x;
closedList.pop_back();
depth--;
break;
}
else {
closedList.pop_back();
depth--;
}
}
}
}
}
return min_path;
}
int main()
{
int h, w, goals = 0;
std::cin >> h >> w;
laby_t *laby;
laby = laby_allocate(h, w);
for(int i = 0; i < laby->h; i++)
std::cin >> laby->pohja[i];
for(int i = 1; i < laby->h-1; i++) {
if(laby->pohja[i][0] == '.') goals++;
if(laby->pohja[i][laby->w-1] == '.') goals++;
}
for(int i = 1; i < laby->w-1; i++) {
if(laby->pohja[0][i] == '.') goals++;
if(laby->pohja[laby->h-1][i] == '.') goals++;
}
for(int i = 0; i < laby->h; i++)
for(int j = 0; j < laby->w; j++) {
if(laby->pohja[i][j] == 'X') {
wander(i, j, laby, goals);
goto _exit;
}
}
_exit:
//system("pause");
return 0;
}
我已经完成了关于错误信号的作业，以防你们不知道:http://www.yolinux.com/TUTORIALS/C++Signals.html
提前致谢。