Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Commit 237b54e

Browse filesBrowse files
CyC2018CyC2018
committed
auto commit
1 parent 21f370a commit 237b54e
Copy full SHA for 237b54e

File tree

Expand file treeCollapse file tree

1 file changed

+1
-1
lines changed
Filter options
Expand file treeCollapse file tree

1 file changed

+1
-1
lines changed

‎notes/Leetcode 题解.md

Copy file name to clipboardExpand all lines: notes/Leetcode 题解.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1290,7 +1290,7 @@ Output: 0
12901290
Explanation: The endWord "cog" is not in wordList, therefore no possible transformation.
12911291
```
12921292

1293-
找出一条从 beginWord 到 endWord 的最短路径，每次移动规定为改变一个字符，并且改变之后的字符串必须在 wordList 中。
1293+
题目描述：找出一条从 beginWord 到 endWord 的最短路径，每次移动规定为改变一个字符，并且改变之后的字符串必须在 wordList 中。
12941294

12951295
```java
12961296
public int ladderLength(String beginWord, String endWord, List<String> wordList) {

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.