思路:
先从最简单的0000转到0002开始。如果我要得到所有转到0002的路径,怎么转呢?先从0000转一下,有8种情况,分别为0001, 0010, 0100,1000,0009,0090,0900,9000。然后呢?再从这8种情况中旋转,得到64种情况……这样就建立起了一个决策树。
遍历决策树有DFS和BFS,DFS就是回溯算法。该题要找最短路径,所以用BFS算法。
第一次运行超时,查询原因是vector的查找太慢了
class Solution {
public:
string switchStringUp(string fs, int j) {
if (fs[j] != '9') fs[j] ++;
else fs[j] = '0';
return fs;
}
string switchStringDown(string fs, int j) {
if (fs[j] != '0') fs[j] --;
else fs[j] = '9';
return fs;
}
int minDepth(string start, string target, vector<string>& deadends) {
queue<string> qu;
set<string> visit;
qu.push(start);
visit.insert(start);
int depth = 0;
while (!qu.empty()) {
int size = qu.size();
for (int i = 0; i < size; i ++) {
string fs = qu.front(); qu.pop();
if (find(deadends.begin(), deadends.end(), fs) != deadends.end()) continue;
if (fs == target) return depth;
for (int j = 0; j < 4; j ++) { //遍历相邻节点
string up = switchStringUp(fs, j);
string down = switchStringDown(fs, j);
if (visit.find(up) == visit.end()) {
qu.push(up);
visit.insert(up);
}
if (visit.find(down) == visit.end()) {
qu.push(down);
visit.insert(down);
}
}
}
depth ++;
}
return -1;
}
int openLock(vector<string>& deadends, string target) {
return minDepth("0000", target, deadends);
}
};
将vector数组的元素放入set中再进行查找,通过
class Solution {
public:
string switchStringUp(string fs, int j) {
if (fs[j] != '9') fs[j] ++;
else fs[j] = '0';
return fs;
}
string switchStringDown(string fs, int j) {
if (fs[j] != '0') fs[j] --;
else fs[j] = '9';
return fs;
}
int openLock(vector<string>& deadends, string target) {
string start = "0000";
queue<string> qu;
set<string> visit;
qu.push(start);
visit.insert(start);
int depth = 0;
while (!qu.empty()) {
int size = qu.size();
for (int i = 0; i < size; i ++) {
string fs = qu.front(); qu.pop();
if (find(deadends.begin(), deadends.end(), fs) != deadends.end()) continue;
if (fs == target) return depth;
for (int j = 0; j < 4; j ++) { //遍历相邻节点
string up = switchStringUp(fs, j);
string down = switchStringDown(fs, j);
if (visit.find(up) == visit.end()) {
qu.push(up);
visit.insert(up);
}
if (visit.find(down) == visit.end()) {
qu.push(down);
visit.insert(down);
}
}
}
depth ++;
}
return -1;
}
};
再将所有的set改为unordered_set,运行时间快了三倍
class Solution {
public:
string switchStringUp(string fs, int j) {
if (fs[j] != '9') fs[j] ++;
else fs[j] = '0';
return fs;
}
string switchStringDown(string fs, int j) {
if (fs[j] != '0') fs[j] --;
else fs[j] = '9';
return fs;
}
int minDepth(string start, string target, vector<string>& tdeadends) {
unordered_set<string> deadends(tdeadends.begin(), tdeadends.end());
queue<string> qu;
unordered_set<string> visit;
qu.push(start);
visit.insert(start);
int depth = 0;
while (!qu.empty()) {
int size = qu.size();
for (int i = 0; i < size; i ++) {
string fs = qu.front(); qu.pop();
if (deadends.count(fs) != 0) continue;
if (fs == target) return depth;
for (int j = 0; j < 4; j ++) { //遍历相邻节点
string up = switchStringUp(fs, j);
string down = switchStringDown(fs, j);
if (visit.find(up) == visit.end()) {
qu.push(up);
visit.insert(up);
}
if (visit.find(down) == visit.end()) {
qu.push(down);
visit.insert(down);
}
}
}
depth ++;
}
return -1;
}
int openLock(vector<string>& deadends, string target) {
return minDepth("0000", target, deadends);
}
};