LeetCode-752. Open the Lock

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

class Solution {
public:
    int openLock(vector<string>& deadends, string target) {
        queue<string> q;
        unordered_set<string> dead;
        unordered_set<string> books; //存储已经访问过的字符串
        for(auto &r:deadends)
        {
            dead.insert(r);
        }
        if(dead.count("0000")) return -1;
        q.push("0000");
        int res=0;
        while(!q.empty())
        {
            for(int i=q.size();i>0;i--)
            {
                string s = q.front();
                q.pop();
                if(!s.compare(target))
                {
                    return res;
                }
                string ss = s;
                for(int j=0;j<4;j++)
                {
                    ss[j] = (ss[j]-'0'+1)%10+'0'; //字符加一情况
                    if(!dead.count(ss)&&!books.count(ss))
                    {
                        q.push(ss);
                        books.insert(ss);
                    }
                    ss[j] = (ss[j]-'0'+8)%10+'0'; //字符减一情况，这里为什么是+8，因为前面一种情况已经给字符加1，所以这要加8，而不是9
                    if(!dead.count(ss) && !books.count(ss)) 
                    {
                        q.push(ss);
                        books.insert(ss);
                    }
                    ss = s;
                }
            }
            res++;
        }
        return -1;
    }
};

这两段代码思路相同，只不过前面那个是用容器保存已访问的点和死点，下面这个是用数组保存，时间上下面的这段快，少了迭代的过程。

class Solution {
public:
    int openLock(vector<string>& deadends, string target) {
        queue<string> q;
        vector<bool> books(10000,false),deads(10000,false);
        string st="0000";
        for(auto &r:deadends)
        {
            books[stoi(r)] = true;
            deads[stoi(r)] = true;
        }
        if(deads[stoi(st)]) return -1;
        q.push(st);
        books[stoi(st)] = true;
        int res=0;
        while(!q.empty())
        {
            for(int i=q.size();i>0;i--)
            {
                string s = q.front();
                q.pop();
                if(s.compare(target)==0) return res;
                string ss = s;
                for(int i=0;i<4;i++)
                {
                    s[i] = (s[i]-'0'+1)%10+'0';
                    if(deads[stoi(s)] == false && books[stoi(s)] == false)
                    {
                        q.push(s);
                        books[stoi(s)]=true;
                    }
                    s[i] = (s[i]-'0'+8)%10+'0';
                    if(deads[stoi(s)] == false && books[stoi(s)] == false)
                    {
                        q.push(s);
                        books[stoi(s)]=true;
                    }
                    s = ss;
                }
            }
            res++;
        }
        return -1;
    }
};