#752. Open the Lock

最新推荐文章于 2022-04-28 23:18:47 发布

原创最新推荐文章于 2022-04-28 23:18:47 发布 · 391 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#算法 #leetcode #有向图

LeetCode 同时被 2 个专栏收录

625 篇文章

订阅专栏

算法

41 篇文章

订阅专栏

本文探讨了一个有趣的算法问题，即如何在避开死锁的情况下，找到从初始状态'0000'到达目标密码所需的最少旋转次数。通过使用广度优先搜索策略，我们实现了对所有可能状态的有效遍历，同时避免了陷入死锁状态。

题目描述：

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) {
        unordered_set<string> visited;
        // 可以把死锁的情况认为是已经访问过的组合
        for (const string& deadend : deadends) {
            visited.insert(deadend);
        }
        int count = 0;
        queue<string> q;
        // 特殊情况单独判断
        if (visited.find("0000") != visited.end()) return -1;
        q.push("0000");
        visited.insert("0000");
        while(!q.empty()) {
            int n = q.size();
            for (int i = 0; i < n; i++) {
                string cur = q.front();
                q.pop();
                if (cur == target) return count;
                for (int j = 0; j < cur.size(); j++) {
                    forward(cur[j]);
                    if (visited.find(cur) == visited.end()) {
                        q.push(cur);
                        visited.insert(cur);
                    }
                    backward(cur[j]);
                    backward(cur[j]);
                    if (visited.find(cur) == visited.end()) {
                        q.push(cur);
                        visited.insert(cur);
                    }
                    forward(cur[j]);
                }
            }
            count ++;
        }
        return -1;
    }
    
    void forward(char& c) {
        c = '0' + (c - '0' + 1) % 10;
    }
    
    void backward(char& c) {
        c = '0' + (c - '0' + 9) % 10;
    }
};