N维bfs

题目链接：https://nanti.jisuanke.com/t/17317

第一次做这样的题目，转化为字符串的问题，进行bfs

//定义个map来记录整个字符串的状态

#include<iostream>
#include<map>
#include<cstring>
#include<string>
#include<queue>
#include<cstdio>
#include<algorithm>
using namespace std;
struct Node
{
	string str;
	int step;
};//字符串及其最短步数
map<string,int>book;
int bfs(string startv,string endv)
{
	queue<Node>que;
	Node now;
	now.str=startv;
	now.step=0;
	que.push(now);
	book[startv]=1;
	while(!que.empty())
	{
		now=que.front();
		que.pop();
		if(now.str==endv)
			return now.step;
		int t=now.step;
		string s=now.str;
		string temp=s;
		for(int i=1;i<s.size();i++)
		{
			swap(temp[0],temp[i]);
			if(book[temp]==0)
			{
				now.str=temp;
				now.step=t+1;
				que.push(now);
				book[temp]=1;
			}
			temp=s;//注意 
		}
	}
}
int main()
{
	char a[15],b[15];
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=0;i<5;i++)
		{
			book.clear();
			scanf("%s %s",a,b);
			printf("%d\n",bfs(a,b));
		}
	}
}