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:

1. The length of deadends will be in the range [1, 500].
2. target will not be in the list deadends.
3. Every string in deadends and the string target will be a string of 4 digits from the 10,000 possibilities '0000' to '9999'.

此题做于 leetcode Weekly Contest 64

题意：

有一个四位锁，每一位都是0~9。每一位都可以从0拨到1,2,3..9，或者0,9,8..，每次只能转动一位。 
锁一开始置于0000，给定一个deadend数组，里面包含一些密码，当转到这里面的密码时，则不能再转动。给定密码target，求出从0000转到target的最短步骤，不如不能转到target，返回-1

思路：

同样做contest的时候没做出来，又是看的discuss 
deadend可能看做一个used数组，表示使用过就不能在使用。 
就是一个BFS，对于每一位都求出他可能走出的下一步，把所有的可能列举出来存入queue（把deadend的存入set，检查是否存在如deadend，存在pass，不存在添加到queue和deadend）。对于queue的每一个，先poll，在求其的每一种可能，直到求到target，或者不能求出结果。

class Solution {
    public int openLock(String[] deadends, String target) {
        Set<String> used = new HashSet<>();
        Queue<String> q = new LinkedList<>();
        q.add("0000");
        used.add("0000");
        for (String d:deadends) {
            if(d.equals("0000"))
                return -1;
            used.add(d);
        }
        int ans = 0;
        while(!q.isEmpty()){
            int size = q.size();
            while(size-->0){
                String cur = q.poll();
                if(cur.equals(target))
                    return ans;
                String[] newStr = getNext(cur);
                for (int i = 0; i < 8; i++) {
                    if(!used.contains(newStr[i])){
                        q.add(newStr[i]);
                        used.add(newStr[i]);
                    }
                }
            }
            ans++;
        }
        return -1;
    }
    //用来求出当前密码的每一种转法
    String[] getNext(String lock){
        String[] res  = new String[8];
        for (int i = 0; i < 4; i++) {
            res[i*2] = lock.substring(0,i)+((lock.charAt(i)-'0'+1)%10)+lock.substring(i+1,4);
            res[i*2+1] = lock.substring(0,i)+((lock.charAt(i)-'0'+9)%10)+lock.substring(i+1,4);
        }
        return res;
    }
}

转载于:https://www.cnblogs.com/linkcode/p/8150730.html