edit 127

fishercoder1534 · fishercoder1534 · commit 2bb2280dc8e0 · 2017-08-05T16:57:11.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_127.java b/src/main/java/com/fishercoder/solutions/_127.java
@@ -10,9 +10,8 @@
  *  Given two words (beginWord and endWord),
  *  and a dictionary's word list,
  *  find the length of shortest transformation sequence from beginWord to endWord, such that:
-
- Only one letter can be changed at a time.
- Each transformed word must exist in the word list. Note that beginWord is not a transformed word.
+ *  Only one letter can be changed at a time.
+ *  Each transformed word must exist in the word list. Note that beginWord is not a transformed word.
 
  For example,
 
@@ -21,8 +20,7 @@
  endWord = "cog"
  wordList = ["hot","dot","dog","lot","log","cog"]
 
- As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog",
- return its length 5.
+ As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog", return its length 5.
 
  Note:
 
@@ -31,8 +29,8 @@
  All words contain only lowercase alphabetic characters.
  You may assume no duplicates in the word list.
  You may assume beginWord and endWord are non-empty and are not the same.
-
  */
+
 public class _127 {
 
     /**reference: https://discuss.leetcode.com/topic/29303/two-end-bfs-in-java-31ms/16*/
