leetcode 752. Open the Lock 遍历开锁 + 典型的广度优先遍历BFS

叁歲伎倆 2022-06-03 10:14 90阅读 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.

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

本题题意很简单，就是旋转密码锁，然后问最少几次可以得到密码，这个是电箱的BFS广度优先遍历的做法，和之前的[leetcode 127. Word Ladder BFS广度优先遍历][leetcode 127. Word Ladder BFS] 和 [leetcode 126. Word Ladder II BFS + 反向链表 + DFS][leetcode 126. Word Ladder II BFS _ _ _ DFS] 做法类似，需要灵活变通

就这么办吧

代码如下：

#include <iostream>
    #include <vector>
    #include <map>
    #include <unordered_map>
    #include <set>
    #include <unordered_set>
    #include <queue>
    #include <stack>
    #include <string>
    #include <climits>
    #include <algorithm>
    #include <sstream>
    #include <functional>
    #include <bitset>
    #include <numeric>
    #include <cmath>
    #include <regex>
    #include <iomanip>
    #include <cstdlib>
    #include <ctime>
    
    using namespace std;
    
    class Solution 
    {
    public:
        int openLock(vector<string>& deadends, string target) 
        {
            set<string> dead(deadends.begin(), deadends.end());
            if (dead.find(target) != dead.end())
                return -1;
            string init = "0000";
            if (dead.find(init) != dead.end())
                return -1;
    
            queue<string> que;
            que.push(init);
            set<string> visit;
            visit.insert(init);
    
            int res = 0;
            while (que.empty() == false)
            {
                res++;
                int size = que.size();
                for (int i = 0; i < size; i++)
                {
                    string one = que.front();
                    que.pop();
                    vector<string> all = getOne(one);
                    for (string i : all)
                    {
                        if (i == target)
                            return res;
                        if (visit.find(i) == visit.end() && dead.find(i) == dead.end())
                        {
                            que.push(i);
                            visit.insert(i);
                        }
                    }
                }
    
            }
            return -1;
        }
    
        vector<string> getOne(string a)
        {
            vector<string> res;
            for (int i = 0; i < 4; i++)
            {
                string tmp = a;
                tmp[i] = (a[i] - '0' + 1) % 10 + '0';
                res.push_back(tmp);
                tmp[i] = (a[i] - '0' - 1 + 10) % 10 + '0';
                res.push_back(tmp);
            }
            return res;
        }
    };

[leetcode 127. Word Ladder BFS]: http://blog.csdn.net/jackzhang_123/article/details/78002561
[leetcode 126. Word Ladder II BFS _ _ _ DFS]: http://blog.csdn.net/jackzhang_123/article/details/78002641