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:
The length of deadends will be in the range [1, 500].
target will not be in the list deadends.
Every string in deadends and the string target will be a string of 4 digits from the 10,000 possibilities ‘0000’ to ‘9999’

Hint:
题目要我们找出解锁的最少步数，要求路径中不能出现deadends中的序列。每次我们可以扭四个数字中的一个，使之+1，或-1，其中0与9是相邻的。
这个问题我们可以使用双向的广度优先搜索，一边从起始的‘0000’开始搜索可以到达的状态，另一边从target反向搜索能够到达target的状态（也是target能到达的状态），当两边搜索到同一个状态时，搜索截止，最少步数即为两个搜索步数之和。
注意‘0000’也可能出现在deadends中，需要在程序开始判断。

class Solution {
public:
    int openLock(vector<string>& deadends, string target) {
        unordered_set<string> dds(deadends.begin(),deadends.end());
        unordered_set<string> visited, qs, qe;
        string sbegin = "0000";
        if (dds.find(sbegin) != dds.end() || dds.find(target) != dds.end()) {
            return -1;
        }
        visited.insert(sbegin);
        visited.insert(target);
        qs.insert(sbegin);
        qe.insert(target);
        int counter = 0;

        while (!qs.empty() && !qe.empty()) {
            counter++;
            if (qs.size() > qe.size()) {  //每次启动size小的进行搜索
                swap(qs,qe);
            }
            unordered_set<string> temp;
            for (auto p = qs.begin(); p != qs.end(); p++) {
                vector<string> canTurnTo = turnTo(*p);
                for (auto q = canTurnTo.begin(); q != canTurnTo.end(); q++) {
                    if (qe.find(*q) != qe.end()) return counter;  //当两个搜索相遇，结束
                    if (dds.find(*q) == dds.end() && visited.find(*q) == dds.end()) {
                        visited.insert(*q);
                        temp.insert(*q);
                    }
                }
            }
            qs = temp;
        }
        return -1;
    }

    vector<string> turnTo(string s) {
        vector<string> canTurnTo;
        for (int i = 0 ; i < 4; i++) {
            string tmp = s;
            tmp[i] = (s[i] - '0' + 1) % 10 + '0';
            canTurnTo.push_back(tmp);
            tmp[i] = (s[i] - '0' - 1 + 10) % 10 + '0';
            canTurnTo.push_back(tmp);
         }
        return canTurnTo;
    }
};