寻路：最多拐弯一次

// OneTurnToDest.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include <iostream> #include <ctime> using namespace std; #define MAP_HORT_COUNT 16 //为简便起见使用固定的行数 void init(int (*pMap)[MAP_HORT_COUNT],int count) { srand((unsigned long)time(0)); for (int i=0;i!=count;++i) { for (int j = 0;j!=MAP_HORT_COUNT;++j) { pMap[i][j] = rand()%3 ? 0:1; } } } bool findroad(int (*pMap)[MAP_HORT_COUNT],int count,int srcx,int srcy,int destx,int desty) { if (count < 0) { cout << "bad count" << endl; return false; } if (srcx < 0 || srcx >MAP_HORT_COUNT-1 || srcy <0 || srcy > count-1 || destx < 0 || destx > MAP_HORT_COUNT-1 || desty < 0 || desty >count-1) { cout << "out of range!" << endl; return false; } //cout << "pMap[srcx][srcy]-pMap[destx][desty]"<< pMap[srcx][srcy] << ","<< pMap[destx][desty]<<endl; //确认源点和目的点是否都能站 if (pMap[srcx][srcy] == 1 || pMap[destx][desty] == 1) { cout << "bad source or dest point"<< pMap[srcx][srcy] << pMap[destx][desty] << endl; return false; } //计算X,Y偏移 int offsetx = destx - srcx; int offsety = desty - srcy; if (offsetx == 0 && offsetx == offsety) { cout << "source and dest point is same" << endl; return true; } //先横向，再纵向 int nowpointx = srcx; int nowpointy = srcy; bool bHFirstValide = true; bool bHFirstHertValide = true; while (nowpointx != destx) { if (offsetx < 0)//目的点在开始点左边 nowpointx --;//向左移动 else nowpointx ++;//向右移动 if (pMap[nowpointx][nowpointy] == 1) { bHFirstHertValide = false; break; } } //cout << "bHFirstHertValide = " << bHFirstHertValide << endl; if (bHFirstHertValide)//横向移动能到达目的点 { while (nowpointy != desty) { if (offsety < 0) nowpointy --; else nowpointy ++; if (pMap[nowpointx][nowpointy] == 1) { bHFirstValide = false; break; } } if (bHFirstValide) { //cout << "bHFirstValide = true" << endl; return true;//纵向也能到达位置。 } } //cout << "bHFirstValide = false" << endl; //先横线再纵向不能到达目的点，尝试先纵向移动，再横向移动。 nowpointx = srcx; nowpointy = srcy; while (nowpointy != desty) { if (offsety < 0) nowpointy --; else nowpointy ++; if (pMap[nowpointx][nowpointy] == 1) { return false;//不可到达 } } while (nowpointx != destx) { if (offsetx < 0) nowpointx --; else nowpointx ++; if (pMap[nowpointx][nowpointy] == 1) { return false; } } return true; } int _tmain(int argc, _TCHAR* argv[]) { int Map[12][MAP_HORT_COUNT]; init(Map,12); cout << "map is :" << endl; for (int j=0;j!=MAP_HORT_COUNT;++j) { // cout << j <<"Column "; for (int i=0;i!=12;++i) { cout << Map[i][j] << ' '; } cout << endl; } cout << endl; cout << "enter the positon.1 1 2 2 means (1,1),(2,2)" << endl; int ibeginx,ibeginy,iendx,iendy; cin >> ibeginx >> ibeginy >> iendx >> iendy; cout << "find ("<< ibeginx <<","<<ibeginy<<"),(" << iendx << "," << iendy <<"):" << endl; bool bFind = findroad(Map,12,ibeginx,ibeginy,iendx,iendy); cout << (bFind?"Road is Available":"Road is not Available") << endl; return 0; }

结果：

 

map is :
0 0 0 1 0 0 1 0 1 0 1 1
0 1 0 0 0 1 0 0 0 1 0 1
1 1 0 1 0 0 1 0 1 0 0 1
0 0 1 0 0 0 0 0 1 0 0 0
0 0 0 0 0 0 1 1 0 0 0 0
0 0 0 0 1 0 1 0 0 0 0 1
0 1 0 0 0 1 1 0 0 0 0 0
1 0 0 0 1 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 1 1 0 1
1 0 0 0 1 1 1 0 0 0 1 1
0 1 1 0 1 0 1 0 0 0 0 0
0 0 1 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 1 1 1 0
1 1 1 1 1 0 1 1 1 0 0 0
0 0 0 0 0 1 1 1 0 0 0 0
0 0 0 0 1 1 1 0 1 0 0 1

enter the positon.1 1 2 2 means (1,1),(2,2)
0 0 2 2
find (0,0),(2,2):
pMap[srcx][srcy]-pMap[destx][desty]0,0
bHFirstHertValide = 1
bHFirstValide = true
1
请按任意键继续. . .