[leetcode]752. Open the Lock

[leetcode]752. Open the Lock

---

Analysis

2019要开心鸭—— [每天刷题并不难0.0]

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.

Explanation:

用bfs列举出每一种可能出现的状态，然后删掉deadend里面的状态，直到找到target状态

Implement

class Solution {
public:
    int openLock(vector<string>& deadends, string target) {
        set<string> deadends1(deadends.begin(), deadends.end());
        if(deadends1.count("0000"))
            return -1;
        if(target == "0000")
            return 0;
        queue<string> mq;
        set<string> have;
        mq.push("0000");
        int res = 0;
        while(!mq.empty()){
            int sz = mq.size();
            for(int k=0; k<sz; k++){
                string cur = mq.front();
                mq.pop();
                for(int i=0; i<4; i++){
                    string tmp = cur;
                    tmp[i] = (cur[i]-'0'+1)%10+'0';
                    if(tmp == target)
                        return ++res;
                    if(!deadends1.count(tmp) && !have.count(tmp))
                        mq.push(tmp);
                    have.insert(tmp);
                    tmp[i] = (cur[i]-'0'-1+10)%10+'0';
                    if(tmp == target)
                        return ++res;
                    if(!deadends1.count(tmp) && !have.count(tmp))
                        mq.push(tmp);
                    have.insert(tmp);
                }
            }
            res++;
        }
        return -1;
    }
};