链接:
https://leetcode-cn.com/problems/open-the-lock/
描述:
示例:
代码:
class Solution {
public:
int openLock(vector<string>& deadends, string target) {
//哈希表用于查询
unordered_set<string> deadendsSet(deadends.begin(),deadends.end());
//如果‘0000’在死亡字符串里面,
if(deadendsSet.find("0000") != deadendsSet.end()) return -1;
//初始化队列
queue<string> q;
q.push("0000");
//加标记,已经搜索过的字符串不需要再次搜索
unordered_set<string> book;
book.insert("0000");
int step = 0;
while(!q.empty())
{
int n = q.size();
for(int i = 0;i<n;++i)
{
string curstr = q.front();
q.pop();
if(curstr == target) return step;
//四位密码锁,四个位置都可以转一次
for(int j = 0;j<4;j++)
{
string newstr1 = curstr;
string newstr2 = curstr;
//当前位置转动一位
newstr1[j] = newstr1[j] == '9'? '0':newstr1[j]+1;
newstr2[j] = newstr2[j] == '0'? '9':newstr2[j]-1;
if(deadendsSet.find(newstr1) == deadendsSet.end()
&& book.find(newstr1) == book.end())
{
q.push(newstr1);
book.insert(newstr1);
}
if(deadendsSet.find(newstr2) == deadendsSet.end()
&& book.find(newstr2) == book.end())
{
q.push(newstr2);
book.insert(newstr2);
}
}
}
step++;
}
return -1;
}
};