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 1:
Input: deadends = ["0201","0101","0102","1212","2002"], target = "0202" Output: 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:
Input: deadends = ["8888"], target = "0009" Output: 1 Explanation: We can turn the last wheel in reverse to move from "0000" -> "0009".
Example 3:
Input: deadends = ["8887","8889","8878","8898","8788","8988","7888","9888"], target = "8888" Output: -1 Explanation: We can't reach the target without getting stuck.
Example 4:
Input: deadends = ["0000"], target = "8888" Output: -1
Note:
- The length of
deadends
will be in the range[1, 500]
. target
will not be in the listdeadends
.- Every string in
deadends
and the stringtarget
will be a string of 4 digits from the 10,000 possibilities'0000'
to'9999'
.
设计一个开锁模拟器。从“0000”开始,每次扭一个位置一格,直到某个目标值target。并且在其过程中不能达到deadends中的状态。使用BFS算法可暴力破解。为了方便,使用四位十进制数字代表锁的状态。代码如下:
class Solution {
public:
int openLock(vector<string>& deadends, string target) {
int result = 0;
bool visited[10001] = {0};
queue<int> q;
q.push(0000);
unordered_set<int> deadendNums;
int targetNums = stoi(target);
for(auto d : deadends) {
deadendNums.insert(stoi(d));
}
while(!q.empty()) {
int n = q.size();
for(int i = 0; i < n; ++i) {
int cur = q.front();
q.pop();
if(visited[cur]) continue;
if(deadendNums.find(cur) != deadendNums.end()) {
continue;
}
if(cur == targetNums) {
return result;
}
visited[cur] = true;
q.push(getNextNum(cur, 1));
q.push(getNextNum(cur, -1));
q.push(getNextNum(cur, 10));
q.push(getNextNum(cur, -10));
q.push(getNextNum(cur, 100));
q.push(getNextNum(cur, -100));
q.push(getNextNum(cur, 1000));
q.push(getNextNum(cur, -1000));
}
++result;
}
return -1;
}
private:
int getNextNum(int cur, int delta) {
bool positive = (delta > 0);
int n = (cur / abs(delta)) % 10;
if(positive == true && n == 9) {
return cur - delta * 9;
}
if(positive == false && n == 0) {
return cur - delta * 9;
}
return cur + delta;
}
};