char map[N][N];
int mark[N][N];
int startX,startY,endX,endY; 起点的坐标S(x.y)和终点的坐标T(x,y)
int isCanMove(int x, int y, int& newX, int& newY, int direction) {
int tempX = x;
int tempY = y;
switch(direction)
{
case 0:
tempX--;break;
case 1:
tempX++;break;
case 2:
tempY--;break;
case 3:
tempY++;break;
}
newX = tempX;
newY = tempY;
if(tempX < 0 || tempX >= N || tempY < 0 || tempY >= N) {
return 0;
}
if(map[tempX][tempY] == '.')
return 1;
}
return 0;
}
int isUesed(int x, int y) {
if(mark[x][y] == 0) {
return 0;
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余2页未读,立即下载