algorithm/CS-Notes
1
0
Fork 0
mirror of https://github.com/CyC2018/CS-Notes.git synced 2025-07-10 04:48:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

auto commit

Browse Source
This commit is contained in:
CyC2018
2018-10-03 20:57:01 +08:00
parent 21f370ad25
commit 237b54ee43
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
notes/Leetcode 题解.md
View File

@ -1290,7 +1290,7 @@ Output: 0
Explanation: The endWord "cog" is not in wordList, therefore no possible transformation.
```
找出一条从 beginWord 到 endWord 的最短路径，每次移动规定为改变一个字符，并且改变之后的字符串必须在 wordList 中。
题目描述：找出一条从 beginWord 到 endWord 的最短路径，每次移动规定为改变一个字符，并且改变之后的字符串必须在 wordList 中。
```java
public int ladderLength(String beginWord, String endWord, List<String> wordList) {