refactor 127

fishercoder1534 · fishercoder1534 · commit ad94913d0da5 · 2021-01-09T06:56:21.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_127.java b/src/main/java/com/fishercoder/solutions/_127.java
@@ -4,32 +4,6 @@
 import java.util.List;
 import java.util.Set;
 
-/**
- * 127. Word Ladder
- *
- *  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.
-
- For example,
-
- Given:
- beginWord = "hit"
- endWord = "cog"
- wordList = ["hot","dot","dog","lot","log","cog"]
-
- As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog", return its length 5.
-
- Note:
-
- Return 0 if there is no such transformation sequence.
- All words have the same length.
- 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 {
     public static class Solution1 {
 
