# Halo

A magic place for coding

0%

## Problem

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:

Example 2:

Example 3:

Example 4:

Constraints:

• 1 <= deadends.length <= 500
• deadends[i].length == 4
• target.length == 4
• target will not be in the list deadends.
• target and deadends[i] consist of digits only.

## Analysis

题目的背景是开锁，从0000开始到题目给定的target，同时还给出了几个deadends状态。这个其实本质上就是一个图的问题，和二维矩阵中的地图是一个道理。deadends就是不能走的地方，转移的状态就是每个位置上+1和-1（0减1变9，9加1变0）。

使用BFS解决，用visited记录已经访问过的状态，每次生成新的状态好，首先要判断是否已经访问过，同时还需要判断是否是deadend，两者都为否才放入queue中。

## Solution

这里处理状态转移有一个技巧，为了统一处理，可以先把数字加10，然后加上变化的+1或-1，然后再取个位数字。

## Summary

这道题的本质还是BFS，只不过背景换成了字符串有点陌生。这道题目的分享到这里，感谢你的支持！

Welcome to my other publishing channels