蓝桥杯+BFS九宫格+了解了c++string compare()和c的string使用

点击打开链接

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
struct Node{
	int x,y;
	int steps;
	string s;
};
const int dx[]={-1,1,0,0};
const int dy[]={0,0,-1,1};
queueQ;
setvis;
string s1,s2;
void BFS()
{
	int i=0,z=0,x=0,y=0,newz=0;
	while(!Q.empty()) Q.pop();
	vis.clear();
	for(z=0;z<9;z++) if(s1[z]=='.') break;
	Node temp1,temp2;
	temp1.x=z/3;temp1.y=z%3;temp1.steps=0;temp1.s=s1;
	vis.insert(s1);
	Q.push(temp1);
	while(!Q.empty()){
		temp1=Q.front();Q.pop();
       /// cout<=0&&temp2.x<3&&temp2.y>=0&&temp2.y<3&&newz>=0&&newz<9){
			     swap(temp2.s[z],temp2.s[newz]);
			     if(!vis.count(temp2.s)){
			     	vis.insert(temp2.s);
			     	temp2.steps+=1;
			     	Q.push(temp2);
			     }
			}
		}
	}
   printf("-1\n");

}
int main()
{

	cin>>s1>>s2;
	BFS();
	return 0;
}