该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

using namespace std;

typedef struct {

int x;

int y;

}Point;//表示一迷宫坐标

void FindWay(int *path,int n,int m,Point start,Point end) {

while(start.x!=end.x || start.y!=end.y) {

cout<

switch(path[start.x*(m+1)+start.y]) {

case 0:start.x--; break;

case 1:start.x--; start.y++; break;

case 2:start.y++; break;

case 3: start.x++; start.y++; break;

case 4: start.x++; break;

case 5:start.x--; start.y--; break;

case 6: start.y--; break;

case 7:start.y--; break;

default: cout<

}

}

cout<

return ;

}

void showAll(int *path,int n,int m)

{

for(int i=1;i<=n;++i) {

for(int j=1;j<=m;j++) {

switch(path[i*(m+1)+j]) {

case 0:cout<

case 1:cout<

case 2:cout<

case 3: cout<

case 4: cout<

case 5:cout<

case 6: cout<

case 7:cout<

default :cout<

}

}

cout<

}

}

class TravelMaze {

private:

Point start,end;

//Point current_point;

int best_num_turn; //最少转向次数

int num_traved;//记录经过多少房间

int curr_num_turn;//当前转向次数

int *TX ;

int *TY ;

int n,m;

int b; //不可进房间数

bool *maze;//迷宫

int *curr_path;//当前解该点下一步走向 0-7 顺时针

int *best_path;//最优解的该点下一步走向 0-7 顺时针

private:

bool IsOK(Point current_point)

{

//是否到达并且最少转向最优

if(num_traved==n*m-b &&

current_point.x==end.x && current_point.y==end.y)

if(curr_num_turn

return true;

return false;

}

void BackTrack(Point current_point,int dir)

{

if(IsOK(current_point)) {

curr_path[current_point.x*(m+1)+current_point.y] = -1;

for(int i=1; i<=n; ++i)

for(int j=1; j<=m; ++j) {

best_path[i*(m+1)+j] =curr_path[i*(m+1)+j];

best_num_turn=curr_num_turn;

}

return;

}

if(current_point.x == end.x && current_point.y == end.y)

return ;

bool flag = true;

Point tmp;

for(int i=0; i<=7; ++i) {

curr_path[current_point.x*(m+1)+current_point.y] = i;

tmp.x = current_point.x + TX[i];

tmp.y = current_point.y + TY[i];

//是否在迷宫内

if(tmp.x<=0 || tmp.y<=0 || tmp.x>n || tmp.y>m)

continue;

//是否已经经过

if(!maze[tmp.x*(m+1)+tmp.y]) {

maze[tmp.x*(m+1)+tmp.y] = true;

if(i!=dir) ++curr_num_turn; //是否转向

++num_traved;

BackTrack(tmp,i);

--num_traved;

if(i!=dir) --curr_num_turn;

//curr_path[current_point.x*(m+1)+current_point.y] = -1;

maze[tmp.x*(m+1)+tmp.y] = false;

}

}

}

public:

int Solve(int n_,int m_,Point bb[],int b_,Point start_,Point end_,int *path)

{

n = n_;//n行

m = m_;//m 列

b = b_;//不可进房间数

start = start_;//开式位置

end = end_;//结束位置

best_num_turn = n*m+1; //最少转向次数

num_traved = 1;//记录经过多少房间

curr_num_turn = 0;

maze = new bool [(n+1)*(m+1)];

for(int i=1;i<=n;i++)

for(int j=1;j<=m;++j)

maze[i*(m+1)+j] = false;

curr_path = new int [(n+1)*(m+1)];

best_path = path;

TX = new int[8];

TY = new int[8];

int tx[] = {-1,-1,0,1,1,1,0,-1};

int ty[] = {0,1,1,1,0,-1,-1,-1};

for(int i=0;i<=7;++i) {

TX[i]=tx[i];

TY[i]=ty[i];

}

for(int i=0;i

curr_path[bb[i].x*(m+1)+bb[i].y] = -1;

maze[bb[i].x*(m+1)+bb[i].y] = true;

}

maze[start.x*(m+1)+start.y] = true;

BackTrack(start_,-1);

delete[] TX;

delete[] TY;

delete[] maze;

delete[] curr_path;

return best_num_turn;

}

};

int main()

{

int n = 3,m=3;

Point a[4];

a[0].x = 1;a[0].y = 2;

a[1].x = 3;a[1].y = 7;

a[2].x = 5;a[2].y = 5;

a[3].x = 8;a[3].y = 2;

int path[(n+1)*(m+1)];

Point start,end;

start.x = start.y = 1;

end.x = end.y = 3;

TravelMaze tm;

int least=tm.Solve(n,m,a,1,start,end,path);

cout<

//FindWay(path,n,m,start,end);

showAll(path,n,m);

cin.get();

return 0;

}