- Open the Lock
中文English
You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: ‘0’, ‘1’, ‘2’, ‘3’, ‘4’, ‘5’, ‘6’, ‘7’, ‘8’, ‘9’. The wheels can rotate freely and wrap around: for example we can turn ‘9’ to be ‘0’, or ‘0’ to be ‘9’. Each move consists of turning one wheel one slot.
The lock initially starts at ‘0000’, a string representing the state of the 4 wheels.
You are given a list of deadends dead ends, meaning if the lock displays any of these codes, the wheels of the lock will stop turning and you will be unable to open it.
Given a target representing the value of the wheels that will unlock the lock, return the minimum total number of turns required to open the lock, or -1 if it is impossible.
Example
Example 1:
Given deadends = [“0201”,“0101”,“0102”,“1212”,“2002”], target = “0202”
Return 6
Explanation:
A sequence of valid moves would be “0000” -> “1000” -> “1100” -> “1200” -> “1201” -> “1202” -> “0202”.
Note that a sequence like “0000” -> “0001” -> “0002” -> “0102” -> “0202” would be invalid,
because the wheels of the lock become stuck after the display becomes the dead end “0102”.
Example 2:
Given deadends = [“8888”], target = “0009”
Return 1
Explanation:
We can turn the last wheel in reverse to move from “0000” -> “0009”.
Notice
1.The length of deadends will be in the range [1, 500].
2.target will not be in the list deadends.
3.Every string in deadends and the string target will be a string of 4 digits from the 10,000 possibilities ‘0000’ to ‘9999’.
解法1: BFS
注意:
1)每个状态对应BFS一个节点。
2) 这题需要加visited,但是因为二维数组过大,我们不需要将visited定义为一个二维数组,将其定义为set即可。
3) 要将deadends存成set,不然vector不好查询。 deadset里面有可能包含start节点"0000",这种情况下直接返回-1。
4) BFS查询过程中要过滤掉visited和deadset着两种情况。
代码如下:
class Solution {
public:
/**
* @param deadends: the list of deadends
* @param target: the value of the wheels that will unlock the lock
* @return: the minimum total number of turns
*/
int openLock(vector<string> &deadends, string &target) {
int n = deadends.size();
string start = "0000";
if (start == target) return 0;
unordered_set<string> deadset;
for (int i = 0; i < n; ++i) {
if (start == deadends[i]) return -1;
deadset.insert(deadends[i]);
}
queue<string> q;
q.push(start);
unordered_set<string> visited;
visited.insert(start);
int round = 0;
while(!q.empty()) {
int qSize = q.size();
round++;
for (int i = 0; i < qSize; ++i) {
string frontNode = q.front();
if (frontNode == target) return round - 1;
q.pop();
for (int j = 0; j < 4; ++j) {
string newNode = frontNode.substr(0, j) + to_string(((frontNode[j] - '0') + 1) % 10) + frontNode.substr(j + 1);
// if (newNode == target) return round;
if (visited.find(newNode) == visited.end() &&
deadset.find(newNode) == deadset.end()) {
q.push(newNode);
visited.insert(newNode);
}
newNode = frontNode.substr(0, j) + to_string(((frontNode[j] - '0') + 9) % 10) + frontNode.substr(j + 1);
// if (newNode == target) return round;
if (visited.find(newNode) == visited.end() &&
deadset.find(newNode) == deadset.end()) {
q.push(newNode);
visited.insert(newNode);
}
}
}
}
return -1;
}
};
解法2:双向BFS。
从start和target两头同时开始BFS,用两个queue,时间复杂度更快。
TBD。