From 237b54ee436a6a1350020e20e51425fc009d0b83 Mon Sep 17 00:00:00 2001
From: CyC2018 <1029579233@qq.com>
Date: Wed, 3 Oct 2018 20:57:01 +0800
Subject: [PATCH] auto commit

---
 notes/Leetcode 题解.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/notes/Leetcode 题解.md b/notes/Leetcode 题解.md
index 11ae7b97..fb41a46d 100644
--- a/notes/Leetcode 题解.md	
+++ b/notes/Leetcode 题解.md	
@@ -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) {