leetcode 752 开锁

题目：
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’.
题目大意就是要我们转动一个转盘锁，使我们可以得到目的数字，要求我们得到目的数字的步数最小，转盘锁初始为“0000”，但是有一个限制，就是锁不能转到“死亡数字”，一旦转到这个死亡数字上，这个锁就会被永久锁上
看完题目之后，很容易就联想到广度优先搜索，层数遍是步数，至于其相邻搜索便是对锁的每一位数字向前或向后拨，一旦找到了目标数字便可以返回层数以终止搜索了
题解：
moved,cnt,q,move=set(deadends),0,[‘0000’],{str(i):[str((i+1)%10),str((i-1)%10)] for i in range(10)}
if ‘0000’ in moved:
return -1
while q:
new,cnt=[],cnt+1
for s in q:
for i,c in enumerate(s):
for cur in (s[:i]+move[c][0]+s[i+1:],s[:i]+move[c][1]+s[i+1:]):
if cur not in moved:
if cur==target:
return cnt
new.append(cur)
moved.add(cur)
q=new
return -1