解题思路
用set存不可达点和已访问点;
层序遍历,每层加一步;
对于每个位置有八种走法,相当于八叉树,但有很多剪枝,所以复杂度可以接受;
当可以走且未访问过时则探索,否则跳过;
当探索点是目标时直接返回当前步数就是最小步数
代码
class Solution {
private:
unordered_set<string> dead;
unordered_set<string> vis;
queue<string> q;
public:
void visit(string s) {
if(!dead.count(s) && !vis.count(s)) {
vis.insert(s);
q.push(s);
}
}
int openLock(vector<string>& deadends, string target) {
if(target == "0000") return 0;
for(auto s : deadends) dead.insert(s);
if(dead.count("0000")) return -1;
q.push("0000"); vis.insert("0000");
int ans = 0;
while(!q.empty()) {
ans++;
int nextlevel = q.size();
while(nextlevel--) {
string now = q.front(); q.pop();
string next;
for(int i = 0; i < 4; i++) {
next = now; next[i] = next[i] == '9' ? '0' : next[i] + 1;
if(next == target) return ans;
visit(next);
}
for(int i = 0; i < 4; i++) {
next = now; next[i] = next[i] == '0' ? '9' : next[i] - 1;
if(next == target) return ans;
visit(next);
}
}
}
return -1;
}
};