背景:还是熟悉bfs,还是调试之后1Y,看来非要写到滚瓜烂熟了!!!。
学习:1.这里队列里每个元素是除了坐标还有步数的结构体。
我的代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
int diagram[8][8];
struct place{int x,y,count;}temp1,temp2,temp3;
int dir[8][2]={2,1,2,-1,1,2,1,-2,-2,1,-2,-1,-1,2,-1,-2};
int main(void){
char a,b;
while(~scanf("%c%d %c%d%*c",&a,&temp1.x,&b,&temp2.x)){
int key=temp1.x,key1=temp2.x;
memset(diagram,1,sizeof(diagram));
temp1.y=a-'a';
temp1.x--;
temp2.x--;
temp2.y=b-'a';
queue<place> q;
temp1.count=0;
q.push(temp1);
diagram[temp1.x][temp1.y]=0;
while(!q.empty()){
temp1=q.front();
//printf("****\n%d\n****\n",temp1.count);
q.pop();
if(temp1.x == temp2.x && temp1.y == temp2.y){printf("To get from %c%d to %c%d takes %d knight moves.\n",a,key,b,key1,temp1.count);break;}
for(int i=0;i < 8;i++){
temp3.x=temp1.x+dir[i][0];
temp3.y=temp1.y+dir[i][1];
if(temp3.x >=0 && temp3.x < 8 && temp3.y >= 0 && temp3.y < 8 && diagram[temp3.x][temp3.y]){
temp3.count=temp1.count+1;
diagram[temp3.x][temp3.y]=0;
q.push(temp3);
}
}
}
}
return 0;
}