赵二的刷题日记032《打开转盘锁》

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

class Solution {
    public int openLock(String[] deadends, String target) {
        //用哈希表存储死亡数字，和访问过的数字
        //进行广度优先遍历
        if ("0000".equals(target))
            return 0;
        
        Set<String> dead = new HashSet<>();//死亡数字
        int step = 0;
        
        for (String d : deadends) {
            dead.add(d);
        }
        
        if (dead.contains(target) || dead.contains("0000"))
            return -1;
        
        Queue<String> queue = new LinkedList<>();
        queue.offer("0000");
        Set<String> seen = new HashSet<>();
        seen.add("0000");
        
        while (!queue.isEmpty()) {
            step++;
            int size = queue.size();
            for (int i = 0; i < size; i++) {//处理当前数拨一次后的数
                String status = queue.poll();
                for (String nextStatus : get(status)) {
                    if (!dead.contains(nextStatus) && !seen.contains(nextStatus)) {
                        if (nextStatus.equals(target)) {
                            return step;
                        }
                        seen.add(nextStatus);
                        queue.offer(nextStatus);
                    }
                }
            }
        }
        
        return -1;
    }
    
    public char numPrev(char x) {//将x向前拨一位
        return x == '0' ? '9' : (char)(x - 1);
    }
    
    public char numSucc(char x) {//将x向后拨一位
        return x == '9' ? '0' : (char)(x + 1);
    }
    
    public List<String> get (String status) {//枚举出status拨动一位的所有结果
        List<String> res = new LinkedList();
        char[] array = status.toCharArray();
        for (int i = 0; i < 4; i++) {
            char num = array[i];
            array[i] = numPrev(num);
            res.add(new String(array));
            array[i] = numSucc(num);
            res.add(new String(array));
            array[i] = num;
        }
        return res;
    }
}