[Leetcode] 752. Open the Lock 解题报告

题目：

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:

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'.

思路：

好久没有用到的BFS华丽丽出场了：我们只需要从“0000”开始往target靠近，不过在靠近的途中，我们需要避免进入deadends里面所包含的陷阱。所以我们的做法就是定义一个哈希表，记录deadends里面的元素，以及我们已经访问过的元素。这样在BFS的过程中，对于当前status，我们枚举从当前status可以达到的8个新的状态，如果新的状态不在deadends中，则我们将其加入队列；否则就跳过。这样在搜索的过程中，一旦发现target就返回。在队列为空的时候如果依然没有达到target，则我们就返回-1。

代码：

class Solution {
public:
    int openLock(vector<string>& deadends, string target) {
        unordered_set<string> hash;         // construct the hash for acceleration
        for (auto &s : deadends) {
            hash.insert(s);
        }
        queue<pair<string, int>> q;
        if (hash.count("0000") == 0) {      // initialize the first starting status "0000"
            q.push(make_pair("0000", 0));
            hash.insert("0000");
        }
        else {
            return -1;
        }
        while (!q.empty()) {
            string status = q.front().first;
            int steps = q.front().second;
            q.pop();
            if (status == target) {
                return steps;
            }
            for (int i = 0; i < 4; ++i) {
                string s1 = turn(status, i, true);
                if (hash.count(s1) == 0) {
                    q.push(make_pair(s1, steps + 1));
                    hash.insert(s1);
                }
                string s2 = turn(status, i, false);
                if (hash.count(s2) == 0) {
                    q.push(make_pair(s2, steps + 1));
                    hash.insert(s2);
                }
            }
        }
        return -1;
    }
private:
    string turn(const string &s, int index, bool increase) {
        string ans(s);
        if (increase) {
            if (ans[index] == '9') {
                ans[index] = '0';
            }
            else {
                ++ans[index];
            }
        }
        else {
            if (ans[index] == '0') {
                ans[index] = '9';
            }
            else {
                --ans[index];
            }
        }
        return ans;
    }
};